./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_security.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_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/psyco/psyco_security.c -s /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/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 8cc1f38a976dda42d71f86348e088e61d77f90eb ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:11,280 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:50:11,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:50:11,291 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:50:11,292 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:50:11,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:50:11,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:50:11,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:50:11,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:50:11,299 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:50:11,300 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:50:11,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:50:11,302 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:50:11,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:50:11,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:50:11,305 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:50:11,306 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:50:11,307 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:50:11,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:50:11,311 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:50:11,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:50:11,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:50:11,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:50:11,319 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:50:11,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:50:11,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:50:11,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:50:11,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:50:11,322 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:50:11,323 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:50:11,323 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:50:11,324 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:50:11,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:50:11,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:50:11,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:50:11,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:50:11,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:50:11,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:50:11,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:50:11,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:50:11,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:50:11,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:50:11,352 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:50:11,352 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:50:11,353 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:50:11,353 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:50:11,353 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:50:11,354 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:50:11,354 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:50:11,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:50:11,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:50:11,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:50:11,355 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:50:11,355 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:50:11,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:50:11,356 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:50:11,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:50:11,356 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:50:11,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:50:11,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:50:11,357 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:50:11,357 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:50:11,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:50:11,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:50:11,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:50:11,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:50:11,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:50:11,358 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:50:11,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:50:11,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:50:11,358 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_de8c455f-08e9-480c-a249-4e75486c6745/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 -> 8cc1f38a976dda42d71f86348e088e61d77f90eb [2019-11-25 08:50:11,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:50:11,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:50:11,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:50:11,554 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:50:11,554 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:50:11,555 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/../../sv-benchmarks/c/psyco/psyco_security.c [2019-11-25 08:50:11,614 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/data/b7abed85a/e991f344d7ea40ccb5aa456acfc1aaab/FLAGf669ee28f [2019-11-25 08:50:12,041 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:50:12,041 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/sv-benchmarks/c/psyco/psyco_security.c [2019-11-25 08:50:12,057 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/data/b7abed85a/e991f344d7ea40ccb5aa456acfc1aaab/FLAGf669ee28f [2019-11-25 08:50:12,403 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/data/b7abed85a/e991f344d7ea40ccb5aa456acfc1aaab [2019-11-25 08:50:12,406 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:50:12,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:50:12,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:12,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:50:12,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:50:12,413 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:12" (1/1) ... [2019-11-25 08:50:12,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31c308b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:12, skipping insertion in model container [2019-11-25 08:50:12,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:50:12" (1/1) ... [2019-11-25 08:50:12,423 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:50:12,454 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:50:12,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:12,685 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:50:12,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:50:12,730 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:50:12,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:12 WrapperNode [2019-11-25 08:50:12,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:50:12,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:12,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:50:12,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:50:12,740 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:12" (1/1) ... [2019-11-25 08:50:12,746 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:12" (1/1) ... [2019-11-25 08:50:12,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:50:12,775 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:50:12,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:50:12,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:50:12,784 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:12" (1/1) ... [2019-11-25 08:50:12,785 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:12" (1/1) ... [2019-11-25 08:50:12,787 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:12" (1/1) ... [2019-11-25 08:50:12,788 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:12" (1/1) ... [2019-11-25 08:50:12,793 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:12" (1/1) ... [2019-11-25 08:50:12,809 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:12" (1/1) ... [2019-11-25 08:50:12,811 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:12" (1/1) ... [2019-11-25 08:50:12,814 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:50:12,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:50:12,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:50:12,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:50:12,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/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:12,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:50:12,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:50:13,335 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:50:13,335 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-25 08:50:13,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:13 BoogieIcfgContainer [2019-11-25 08:50:13,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:50:13,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:50:13,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:50:13,340 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:50:13,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:50:12" (1/3) ... [2019-11-25 08:50:13,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8bd0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:13, skipping insertion in model container [2019-11-25 08:50:13,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:50:12" (2/3) ... [2019-11-25 08:50:13,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c8bd0a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:50:13, skipping insertion in model container [2019-11-25 08:50:13,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:50:13" (3/3) ... [2019-11-25 08:50:13,353 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-11-25 08:50:13,362 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:50:13,369 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:50:13,392 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:50:13,424 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:50:13,425 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:50:13,426 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:50:13,426 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:50:13,426 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:50:13,427 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:50:13,427 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:50:13,429 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:50:13,449 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states. [2019-11-25 08:50:13,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:50:13,454 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,455 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,456 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,462 INFO L82 PathProgramCache]: Analyzing trace with hash 352571364, now seen corresponding path program 1 times [2019-11-25 08:50:13,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720285227] [2019-11-25 08:50:13,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,604 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:13,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720285227] [2019-11-25 08:50:13,606 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,606 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:50:13,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904800613] [2019-11-25 08:50:13,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-25 08:50:13,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-25 08:50:13,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:50:13,628 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 2 states. [2019-11-25 08:50:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,674 INFO L93 Difference]: Finished difference Result 154 states and 292 transitions. [2019-11-25 08:50:13,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-25 08:50:13,675 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2019-11-25 08:50:13,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,687 INFO L225 Difference]: With dead ends: 154 [2019-11-25 08:50:13,687 INFO L226 Difference]: Without dead ends: 74 [2019-11-25 08:50:13,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-25 08:50:13,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-25 08:50:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-25 08:50:13,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-25 08:50:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 109 transitions. [2019-11-25 08:50:13,737 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 109 transitions. Word has length 9 [2019-11-25 08:50:13,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,737 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 109 transitions. [2019-11-25 08:50:13,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-25 08:50:13,738 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 109 transitions. [2019-11-25 08:50:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:50:13,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,740 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1422697708, now seen corresponding path program 1 times [2019-11-25 08:50:13,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233411734] [2019-11-25 08:50:13,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,776 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:13,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233411734] [2019-11-25 08:50:13,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:13,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150160675] [2019-11-25 08:50:13,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:13,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:13,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:13,778 INFO L87 Difference]: Start difference. First operand 74 states and 109 transitions. Second operand 3 states. [2019-11-25 08:50:13,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,846 INFO L93 Difference]: Finished difference Result 149 states and 220 transitions. [2019-11-25 08:50:13,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:13,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-25 08:50:13,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,848 INFO L225 Difference]: With dead ends: 149 [2019-11-25 08:50:13,849 INFO L226 Difference]: Without dead ends: 77 [2019-11-25 08:50:13,850 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:13,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-25 08:50:13,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-11-25 08:50:13,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-11-25 08:50:13,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 112 transitions. [2019-11-25 08:50:13,860 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 112 transitions. Word has length 10 [2019-11-25 08:50:13,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,860 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 112 transitions. [2019-11-25 08:50:13,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:13,861 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 112 transitions. [2019-11-25 08:50:13,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-25 08:50:13,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,862 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,862 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,863 INFO L82 PathProgramCache]: Analyzing trace with hash 658032583, now seen corresponding path program 1 times [2019-11-25 08:50:13,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822673855] [2019-11-25 08:50:13,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:13,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:13,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822673855] [2019-11-25 08:50:13,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:13,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:13,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161242139] [2019-11-25 08:50:13,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:13,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:13,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:13,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:13,890 INFO L87 Difference]: Start difference. First operand 77 states and 112 transitions. Second operand 3 states. [2019-11-25 08:50:13,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:13,954 INFO L93 Difference]: Finished difference Result 142 states and 209 transitions. [2019-11-25 08:50:13,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:13,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-25 08:50:13,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:13,956 INFO L225 Difference]: With dead ends: 142 [2019-11-25 08:50:13,956 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 08:50:13,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:13,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 08:50:13,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 08:50:13,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:50:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2019-11-25 08:50:13,963 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 15 [2019-11-25 08:50:13,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:13,963 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2019-11-25 08:50:13,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:13,963 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2019-11-25 08:50:13,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-25 08:50:13,964 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:13,965 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:13,965 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:13,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:13,965 INFO L82 PathProgramCache]: Analyzing trace with hash 2066489199, now seen corresponding path program 1 times [2019-11-25 08:50:13,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:13,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049710383] [2019-11-25 08:50:13,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:13,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,016 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:14,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049710383] [2019-11-25 08:50:14,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507144764] [2019-11-25 08:50:14,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,018 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand 3 states. [2019-11-25 08:50:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,144 INFO L93 Difference]: Finished difference Result 188 states and 276 transitions. [2019-11-25 08:50:14,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-25 08:50:14,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,147 INFO L225 Difference]: With dead ends: 188 [2019-11-25 08:50:14,147 INFO L226 Difference]: Without dead ends: 118 [2019-11-25 08:50:14,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-25 08:50:14,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 104. [2019-11-25 08:50:14,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-25 08:50:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 149 transitions. [2019-11-25 08:50:14,157 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 149 transitions. Word has length 18 [2019-11-25 08:50:14,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,157 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 149 transitions. [2019-11-25 08:50:14,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,157 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 149 transitions. [2019-11-25 08:50:14,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-25 08:50:14,158 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,159 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,159 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,159 INFO L82 PathProgramCache]: Analyzing trace with hash 290326405, now seen corresponding path program 1 times [2019-11-25 08:50:14,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439809607] [2019-11-25 08:50:14,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:50:14,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439809607] [2019-11-25 08:50:14,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333093444] [2019-11-25 08:50:14,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,203 INFO L87 Difference]: Start difference. First operand 104 states and 149 transitions. Second operand 3 states. [2019-11-25 08:50:14,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,252 INFO L93 Difference]: Finished difference Result 179 states and 256 transitions. [2019-11-25 08:50:14,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-25 08:50:14,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,254 INFO L225 Difference]: With dead ends: 179 [2019-11-25 08:50:14,254 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 08:50:14,255 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 08:50:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2019-11-25 08:50:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2019-11-25 08:50:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 113 transitions. [2019-11-25 08:50:14,261 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 113 transitions. Word has length 19 [2019-11-25 08:50:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,261 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 113 transitions. [2019-11-25 08:50:14,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,262 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 113 transitions. [2019-11-25 08:50:14,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:50:14,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,263 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,264 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1696736468, now seen corresponding path program 1 times [2019-11-25 08:50:14,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399633439] [2019-11-25 08:50:14,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:14,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399633439] [2019-11-25 08:50:14,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370301385] [2019-11-25 08:50:14,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,304 INFO L87 Difference]: Start difference. First operand 81 states and 113 transitions. Second operand 3 states. [2019-11-25 08:50:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,347 INFO L93 Difference]: Finished difference Result 130 states and 186 transitions. [2019-11-25 08:50:14,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:50:14,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,352 INFO L225 Difference]: With dead ends: 130 [2019-11-25 08:50:14,352 INFO L226 Difference]: Without dead ends: 66 [2019-11-25 08:50:14,352 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-25 08:50:14,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-25 08:50:14,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:50:14,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2019-11-25 08:50:14,358 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 25 [2019-11-25 08:50:14,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,358 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2019-11-25 08:50:14,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,358 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2019-11-25 08:50:14,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:50:14,363 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,363 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,364 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1712893632, now seen corresponding path program 1 times [2019-11-25 08:50:14,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233200222] [2019-11-25 08:50:14,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:14,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233200222] [2019-11-25 08:50:14,426 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570027324] [2019-11-25 08:50:14,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,427 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand 3 states. [2019-11-25 08:50:14,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,515 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2019-11-25 08:50:14,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:50:14,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,517 INFO L225 Difference]: With dead ends: 154 [2019-11-25 08:50:14,517 INFO L226 Difference]: Without dead ends: 107 [2019-11-25 08:50:14,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-25 08:50:14,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2019-11-25 08:50:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-25 08:50:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 134 transitions. [2019-11-25 08:50:14,525 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 134 transitions. Word has length 26 [2019-11-25 08:50:14,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,525 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 134 transitions. [2019-11-25 08:50:14,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,526 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 134 transitions. [2019-11-25 08:50:14,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:50:14,526 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,527 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 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:14,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1584038971, now seen corresponding path program 1 times [2019-11-25 08:50:14,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,527 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865400936] [2019-11-25 08:50:14,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,555 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:14,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865400936] [2019-11-25 08:50:14,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463729705] [2019-11-25 08:50:14,556 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,557 INFO L87 Difference]: Start difference. First operand 95 states and 134 transitions. Second operand 3 states. [2019-11-25 08:50:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,595 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2019-11-25 08:50:14,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,596 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:50:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,596 INFO L225 Difference]: With dead ends: 162 [2019-11-25 08:50:14,597 INFO L226 Difference]: Without dead ends: 88 [2019-11-25 08:50:14,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-25 08:50:14,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2019-11-25 08:50:14,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 08:50:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 116 transitions. [2019-11-25 08:50:14,604 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 116 transitions. Word has length 27 [2019-11-25 08:50:14,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,604 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 116 transitions. [2019-11-25 08:50:14,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,605 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 116 transitions. [2019-11-25 08:50:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:50:14,606 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,606 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 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:14,606 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1447684816, now seen corresponding path program 1 times [2019-11-25 08:50:14,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433468844] [2019-11-25 08:50:14,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:14,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433468844] [2019-11-25 08:50:14,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992412442] [2019-11-25 08:50:14,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,628 INFO L87 Difference]: Start difference. First operand 88 states and 116 transitions. Second operand 3 states. [2019-11-25 08:50:14,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,664 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2019-11-25 08:50:14,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,665 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:50:14,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,665 INFO L225 Difference]: With dead ends: 135 [2019-11-25 08:50:14,665 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 08:50:14,666 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 08:50:14,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-11-25 08:50:14,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-25 08:50:14,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 87 transitions. [2019-11-25 08:50:14,670 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 87 transitions. Word has length 27 [2019-11-25 08:50:14,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,670 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 87 transitions. [2019-11-25 08:50:14,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,670 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 87 transitions. [2019-11-25 08:50:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:50:14,671 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,671 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 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:14,671 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,672 INFO L82 PathProgramCache]: Analyzing trace with hash -573380405, now seen corresponding path program 1 times [2019-11-25 08:50:14,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748668743] [2019-11-25 08:50:14,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:14,719 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748668743] [2019-11-25 08:50:14,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665249414] [2019-11-25 08:50:14,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,720 INFO L87 Difference]: Start difference. First operand 68 states and 87 transitions. Second operand 3 states. [2019-11-25 08:50:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,763 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2019-11-25 08:50:14,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,766 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:50:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,767 INFO L225 Difference]: With dead ends: 70 [2019-11-25 08:50:14,767 INFO L226 Difference]: Without dead ends: 66 [2019-11-25 08:50:14,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-25 08:50:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-25 08:50:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:50:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 84 transitions. [2019-11-25 08:50:14,771 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 84 transitions. Word has length 28 [2019-11-25 08:50:14,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,771 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 84 transitions. [2019-11-25 08:50:14,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,772 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 84 transitions. [2019-11-25 08:50:14,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:50:14,772 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:50:14,773 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:50:14,773 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:50:14,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:50:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash -583473182, now seen corresponding path program 1 times [2019-11-25 08:50:14,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:50:14,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413205368] [2019-11-25 08:50:14,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:50:14,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:50:14,809 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:50:14,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413205368] [2019-11-25 08:50:14,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:50:14,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:50:14,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369559201] [2019-11-25 08:50:14,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:50:14,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:50:14,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:50:14,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,811 INFO L87 Difference]: Start difference. First operand 66 states and 84 transitions. Second operand 3 states. [2019-11-25 08:50:14,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:50:14,837 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2019-11-25 08:50:14,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:50:14,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-25 08:50:14,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:50:14,838 INFO L225 Difference]: With dead ends: 107 [2019-11-25 08:50:14,838 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:50:14,839 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:50:14,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:50:14,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:50:14,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:50:14,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:50:14,840 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-11-25 08:50:14,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:50:14,840 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:50:14,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:50:14,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:50:14,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:50:14,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:50:14,954 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-11-25 08:50:14,955 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-11-25 08:50:14,956 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-11-25 08:50:14,957 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-11-25 08:50:14,957 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-11-25 08:50:14,957 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-11-25 08:50:14,957 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-11-25 08:50:14,957 INFO L440 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and (<= ULTIMATE.start_main_~this_state~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-25 08:50:14,957 INFO L444 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-11-25 08:50:14,957 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-11-25 08:50:14,958 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L440 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-11-25 08:50:14,959 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L447 ceAbstractionStarter]: At program point L13(lines 13 390) the Hoare annotation is: true [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-11-25 08:50:14,960 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-11-25 08:50:14,961 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-11-25 08:50:14,962 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-11-25 08:50:14,962 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-11-25 08:50:14,962 INFO L444 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-11-25 08:50:14,962 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-11-25 08:50:14,962 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-11-25 08:50:14,966 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-11-25 08:50:14,966 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-11-25 08:50:14,968 INFO L440 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~this_state~0 0))) (or (and (= ULTIMATE.start_main_~q~0 3) (= 2 ULTIMATE.start_main_~this_state~0)) (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-25 08:50:14,968 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-11-25 08:50:14,968 INFO L444 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-11-25 08:50:14,968 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-11-25 08:50:14,968 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-11-25 08:50:14,969 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-11-25 08:50:14,969 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-11-25 08:50:14,969 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-11-25 08:50:14,969 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-11-25 08:50:14,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:50:14 BoogieIcfgContainer [2019-11-25 08:50:14,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:50:14,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:50:14,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:50:14,992 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:50:14,993 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:13" (3/4) ... [2019-11-25 08:50:14,996 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:50:15,017 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-25 08:50:15,021 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:50:15,084 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_de8c455f-08e9-480c-a249-4e75486c6745/bin/uautomizer/witness.graphml [2019-11-25 08:50:15,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:50:15,086 INFO L168 Benchmark]: Toolchain (without parser) took 2678.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 925.1 MB in the end (delta: 25.0 MB). Peak memory consumption was 152.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:15,087 INFO L168 Benchmark]: CDTParser took 0.16 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:15,087 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:15,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:50:15,088 INFO L168 Benchmark]: Boogie Preprocessor took 39.42 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:15,089 INFO L168 Benchmark]: RCFGBuilder took 521.65 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:15,090 INFO L168 Benchmark]: TraceAbstraction took 1654.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 150.4 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:15,094 INFO L168 Benchmark]: Witness Printer took 92.37 ms. Allocated memory is still 1.2 GB. Free memory was 931.9 MB in the beginning and 925.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:50:15,096 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.16 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 323.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.9 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.42 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 521.65 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1654.61 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 931.9 MB in the end (delta: 150.4 MB). Peak memory consumption was 150.4 MB. Max. memory is 11.5 GB. * Witness Printer took 92.37 ms. Allocated memory is still 1.2 GB. Free memory was 931.9 MB in the beginning and 925.1 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((q == 3 && 2 == this_state) || (4 <= q && 3 == this_state)) || (this_state <= 0 && q == 2)) || (this_state <= 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (4 <= q && 3 == this_state) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 78 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 963 SDtfs, 337 SDslu, 415 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 46 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 8086 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 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...