./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_8.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_8.c -s /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2cbbf56a13532141372a32a461d64a9d1351c0e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 21:12:01,554 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:12:01,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:12:01,563 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:12:01,563 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:12:01,564 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:12:01,565 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:12:01,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:12:01,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:12:01,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:12:01,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:12:01,569 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:12:01,570 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:12:01,570 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:12:01,571 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:12:01,572 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:12:01,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:12:01,573 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:12:01,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:12:01,576 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:12:01,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:12:01,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:12:01,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:12:01,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:12:01,580 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:12:01,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:12:01,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:12:01,581 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:12:01,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:12:01,582 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:12:01,582 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:12:01,583 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:12:01,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:12:01,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:12:01,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:12:01,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:12:01,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:12:01,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:12:01,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:12:01,585 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:12:01,586 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:12:01,586 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:12:01,596 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:12:01,596 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:12:01,596 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:12:01,597 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:12:01,597 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:12:01,598 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:12:01,598 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:12:01,598 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:12:01,598 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:12:01,598 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:12:01,598 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:12:01,598 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:12:01,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:12:01,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:12:01,600 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:12:01,600 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:12:01,600 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:12:01,600 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:12:01,600 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:12:01,600 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:12:01,600 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:12:01,600 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:12:01,601 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:12:01,601 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:12:01,601 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:12:01,601 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:12:01,601 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan 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 -> Taipan 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 -> f2cbbf56a13532141372a32a461d64a9d1351c0e [2019-12-07 21:12:01,698 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:12:01,708 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:12:01,711 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:12:01,712 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:12:01,713 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:12:01,713 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/../../sv-benchmarks/c/locks/test_locks_8.c [2019-12-07 21:12:01,754 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/data/5a302ef27/25c0b76eb7cb495bacf091c7bcb81673/FLAGaa8454972 [2019-12-07 21:12:02,158 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:12:02,158 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/sv-benchmarks/c/locks/test_locks_8.c [2019-12-07 21:12:02,163 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/data/5a302ef27/25c0b76eb7cb495bacf091c7bcb81673/FLAGaa8454972 [2019-12-07 21:12:02,172 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/data/5a302ef27/25c0b76eb7cb495bacf091c7bcb81673 [2019-12-07 21:12:02,174 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:12:02,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:12:02,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:12:02,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:12:02,178 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:12:02,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,180 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b1d85b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02, skipping insertion in model container [2019-12-07 21:12:02,180 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,185 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:12:02,198 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:12:02,298 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:12:02,331 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:12:02,350 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:12:02,359 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:12:02,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02 WrapperNode [2019-12-07 21:12:02,359 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:12:02,360 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:12:02,360 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:12:02,360 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:12:02,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,385 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:12:02,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:12:02,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:12:02,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:12:02,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,392 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,398 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... [2019-12-07 21:12:02,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:12:02,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:12:02,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:12:02,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:12:02,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:12:02,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:12:02,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:12:02,690 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:12:02,690 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-12-07 21:12:02,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:12:02 BoogieIcfgContainer [2019-12-07 21:12:02,691 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:12:02,691 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:12:02,691 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:12:02,694 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:12:02,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:12:02" (1/3) ... [2019-12-07 21:12:02,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4180d349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:12:02, skipping insertion in model container [2019-12-07 21:12:02,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:12:02" (2/3) ... [2019-12-07 21:12:02,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4180d349 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:12:02, skipping insertion in model container [2019-12-07 21:12:02,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:12:02" (3/3) ... [2019-12-07 21:12:02,696 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_8.c [2019-12-07 21:12:02,702 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:12:02,706 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 21:12:02,713 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 21:12:02,728 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:12:02,728 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:12:02,728 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:12:02,728 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:12:02,728 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:12:02,728 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:12:02,728 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:12:02,729 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:12:02,738 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2019-12-07 21:12:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-07 21:12:02,741 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:02,741 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-07 21:12:02,742 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:02,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:02,745 INFO L82 PathProgramCache]: Analyzing trace with hash 930766353, now seen corresponding path program 1 times [2019-12-07 21:12:02,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:02,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221750445] [2019-12-07 21:12:02,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:02,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221750445] [2019-12-07 21:12:02,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:02,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:02,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28540104] [2019-12-07 21:12:02,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:02,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:02,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:02,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:02,877 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 4 states. [2019-12-07 21:12:02,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:02,907 INFO L93 Difference]: Finished difference Result 50 states and 81 transitions. [2019-12-07 21:12:02,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:02,908 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2019-12-07 21:12:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:02,915 INFO L225 Difference]: With dead ends: 50 [2019-12-07 21:12:02,915 INFO L226 Difference]: Without dead ends: 39 [2019-12-07 21:12:02,917 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-12-07 21:12:02,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-12-07 21:12:02,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 21. [2019-12-07 21:12:02,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:12:02,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 35 transitions. [2019-12-07 21:12:02,940 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 35 transitions. Word has length 6 [2019-12-07 21:12:02,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:02,940 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 35 transitions. [2019-12-07 21:12:02,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:02,941 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 35 transitions. [2019-12-07 21:12:02,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 21:12:02,941 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:02,941 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:12:02,941 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:02,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:02,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1210800134, now seen corresponding path program 1 times [2019-12-07 21:12:02,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:02,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070372655] [2019-12-07 21:12:02,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:02,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:02,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:02,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070372655] [2019-12-07 21:12:02,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:02,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:02,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524616434] [2019-12-07 21:12:02,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:02,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:02,977 INFO L87 Difference]: Start difference. First operand 21 states and 35 transitions. Second operand 4 states. [2019-12-07 21:12:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:02,992 INFO L93 Difference]: Finished difference Result 39 states and 63 transitions. [2019-12-07 21:12:02,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:02,992 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2019-12-07 21:12:02,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:02,993 INFO L225 Difference]: With dead ends: 39 [2019-12-07 21:12:02,993 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 21:12:02,994 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-12-07 21:12:02,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 21:12:02,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 21. [2019-12-07 21:12:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:12:02,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 34 transitions. [2019-12-07 21:12:02,997 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 34 transitions. Word has length 7 [2019-12-07 21:12:02,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:02,997 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 34 transitions. [2019-12-07 21:12:02,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:02,998 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 34 transitions. [2019-12-07 21:12:02,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 21:12:02,998 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:02,998 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:12:02,998 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:02,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:02,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115846, now seen corresponding path program 1 times [2019-12-07 21:12:02,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:02,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992304122] [2019-12-07 21:12:02,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:03,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:03,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:03,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992304122] [2019-12-07 21:12:03,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:03,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:03,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552166869] [2019-12-07 21:12:03,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:03,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:03,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:03,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:03,032 INFO L87 Difference]: Start difference. First operand 21 states and 34 transitions. Second operand 4 states. [2019-12-07 21:12:03,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:03,047 INFO L93 Difference]: Finished difference Result 37 states and 58 transitions. [2019-12-07 21:12:03,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:03,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2019-12-07 21:12:03,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:03,048 INFO L225 Difference]: With dead ends: 37 [2019-12-07 21:12:03,049 INFO L226 Difference]: Without dead ends: 35 [2019-12-07 21:12:03,049 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-12-07 21:12:03,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-12-07 21:12:03,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 21. [2019-12-07 21:12:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:12:03,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 33 transitions. [2019-12-07 21:12:03,053 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 33 transitions. Word has length 8 [2019-12-07 21:12:03,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:03,053 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 33 transitions. [2019-12-07 21:12:03,054 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:03,054 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 33 transitions. [2019-12-07 21:12:03,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:12:03,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:03,054 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:12:03,054 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:03,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:03,055 INFO L82 PathProgramCache]: Analyzing trace with hash 364067535, now seen corresponding path program 1 times [2019-12-07 21:12:03,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:03,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931467631] [2019-12-07 21:12:03,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:03,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:03,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931467631] [2019-12-07 21:12:03,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:03,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:03,090 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488809853] [2019-12-07 21:12:03,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:03,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:03,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:03,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:03,091 INFO L87 Difference]: Start difference. First operand 21 states and 33 transitions. Second operand 4 states. [2019-12-07 21:12:03,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:03,104 INFO L93 Difference]: Finished difference Result 35 states and 53 transitions. [2019-12-07 21:12:03,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:03,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-12-07 21:12:03,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:03,105 INFO L225 Difference]: With dead ends: 35 [2019-12-07 21:12:03,105 INFO L226 Difference]: Without dead ends: 33 [2019-12-07 21:12:03,105 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-12-07 21:12:03,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-12-07 21:12:03,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2019-12-07 21:12:03,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:12:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 32 transitions. [2019-12-07 21:12:03,108 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 32 transitions. Word has length 9 [2019-12-07 21:12:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:03,108 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 32 transitions. [2019-12-07 21:12:03,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 32 transitions. [2019-12-07 21:12:03,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 21:12:03,108 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:03,109 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:12:03,109 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:03,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:03,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1598593285, now seen corresponding path program 1 times [2019-12-07 21:12:03,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:03,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534129264] [2019-12-07 21:12:03,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:03,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534129264] [2019-12-07 21:12:03,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:03,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:03,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790621109] [2019-12-07 21:12:03,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:03,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:03,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:03,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:03,134 INFO L87 Difference]: Start difference. First operand 21 states and 32 transitions. Second operand 4 states. [2019-12-07 21:12:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:03,145 INFO L93 Difference]: Finished difference Result 33 states and 48 transitions. [2019-12-07 21:12:03,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:03,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-12-07 21:12:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:03,146 INFO L225 Difference]: With dead ends: 33 [2019-12-07 21:12:03,146 INFO L226 Difference]: Without dead ends: 31 [2019-12-07 21:12:03,146 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-12-07 21:12:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-12-07 21:12:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2019-12-07 21:12:03,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:12:03,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 31 transitions. [2019-12-07 21:12:03,148 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 31 transitions. Word has length 10 [2019-12-07 21:12:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:03,149 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 31 transitions. [2019-12-07 21:12:03,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 31 transitions. [2019-12-07 21:12:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 21:12:03,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:03,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:12:03,149 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:03,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:03,149 INFO L82 PathProgramCache]: Analyzing trace with hash 1983431076, now seen corresponding path program 1 times [2019-12-07 21:12:03,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:03,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094766670] [2019-12-07 21:12:03,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:03,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:03,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094766670] [2019-12-07 21:12:03,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:03,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:03,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70773592] [2019-12-07 21:12:03,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:03,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:03,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:03,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:03,174 INFO L87 Difference]: Start difference. First operand 21 states and 31 transitions. Second operand 4 states. [2019-12-07 21:12:03,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:03,186 INFO L93 Difference]: Finished difference Result 31 states and 43 transitions. [2019-12-07 21:12:03,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:03,186 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 21:12:03,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:03,187 INFO L225 Difference]: With dead ends: 31 [2019-12-07 21:12:03,187 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 21:12:03,187 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-12-07 21:12:03,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 21:12:03,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2019-12-07 21:12:03,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:12:03,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2019-12-07 21:12:03,189 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 30 transitions. Word has length 11 [2019-12-07 21:12:03,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:03,189 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 30 transitions. [2019-12-07 21:12:03,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:03,190 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 30 transitions. [2019-12-07 21:12:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 21:12:03,190 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:03,190 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:12:03,190 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:03,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:03,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1357036912, now seen corresponding path program 1 times [2019-12-07 21:12:03,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:03,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152686159] [2019-12-07 21:12:03,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:03,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152686159] [2019-12-07 21:12:03,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:03,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:03,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363127551] [2019-12-07 21:12:03,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:03,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:03,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:03,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:03,213 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. Second operand 4 states. [2019-12-07 21:12:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:03,226 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-12-07 21:12:03,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:03,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-12-07 21:12:03,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:03,227 INFO L225 Difference]: With dead ends: 29 [2019-12-07 21:12:03,227 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 21:12:03,227 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-12-07 21:12:03,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 21:12:03,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2019-12-07 21:12:03,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-12-07 21:12:03,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2019-12-07 21:12:03,229 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 12 [2019-12-07 21:12:03,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:03,229 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2019-12-07 21:12:03,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:03,229 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2019-12-07 21:12:03,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 21:12:03,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:12:03,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:12:03,230 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:12:03,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:12:03,230 INFO L82 PathProgramCache]: Analyzing trace with hash -881312647, now seen corresponding path program 1 times [2019-12-07 21:12:03,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:12:03,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385700564] [2019-12-07 21:12:03,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:12:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:12:03,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:12:03,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385700564] [2019-12-07 21:12:03,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:12:03,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:12:03,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583184053] [2019-12-07 21:12:03,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:12:03,252 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:12:03,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:12:03,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:12:03,252 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand 4 states. [2019-12-07 21:12:03,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:12:03,264 INFO L93 Difference]: Finished difference Result 23 states and 31 transitions. [2019-12-07 21:12:03,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:12:03,264 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 21:12:03,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:12:03,265 INFO L225 Difference]: With dead ends: 23 [2019-12-07 21:12:03,265 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 21:12:03,265 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-12-07 21:12:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 21:12:03,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 21:12:03,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 21:12:03,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 21:12:03,265 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 13 [2019-12-07 21:12:03,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:12:03,266 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 21:12:03,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:12:03,266 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 21:12:03,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 21:12:03,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 21:12:03,276 INFO L246 CegarLoopResult]: For program point L126(line 126) no Hoare annotation was computed. [2019-12-07 21:12:03,276 INFO L242 CegarLoopResult]: At program point L126-1(lines 5 135) the Hoare annotation is: false [2019-12-07 21:12:03,276 INFO L246 CegarLoopResult]: For program point L110-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,276 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L111(line 111) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L95-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L120-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L96(line 96) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L121(line 121) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L105-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L106(line 106) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L249 CegarLoopResult]: At program point L131(lines 5 135) the Hoare annotation is: true [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L90-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 133) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L115-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L91(line 91) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L116(line 116) no Hoare annotation was computed. [2019-12-07 21:12:03,277 INFO L246 CegarLoopResult]: For program point L100-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,278 INFO L249 CegarLoopResult]: At program point L125-1(lines 33 130) the Hoare annotation is: true [2019-12-07 21:12:03,278 INFO L246 CegarLoopResult]: For program point L84-1(lines 33 130) no Hoare annotation was computed. [2019-12-07 21:12:03,278 INFO L249 CegarLoopResult]: At program point L134(lines 4 135) the Hoare annotation is: true [2019-12-07 21:12:03,278 INFO L246 CegarLoopResult]: For program point L101(line 101) no Hoare annotation was computed. [2019-12-07 21:12:03,278 INFO L246 CegarLoopResult]: For program point L35(lines 35 37) no Hoare annotation was computed. [2019-12-07 21:12:03,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:12:03 BoogieIcfgContainer [2019-12-07 21:12:03,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:12:03,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:12:03,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:12:03,285 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:12:03,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:12:02" (3/4) ... [2019-12-07 21:12:03,287 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 21:12:03,294 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 21:12:03,294 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 21:12:03,295 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 21:12:03,334 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_bd7259e5-573c-416b-a37e-a84be7bea777/bin/utaipan/witness.graphml [2019-12-07 21:12:03,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:12:03,335 INFO L168 Benchmark]: Toolchain (without parser) took 1160.29 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.3 MB in the beginning and 955.8 MB in the end (delta: -16.4 MB). Peak memory consumption was 71.1 MB. Max. memory is 11.5 GB. [2019-12-07 21:12:03,335 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:12:03,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 184.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:12:03,336 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:12:03,336 INFO L168 Benchmark]: Boogie Preprocessor took 14.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:12:03,336 INFO L168 Benchmark]: RCFGBuilder took 290.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:12:03,336 INFO L168 Benchmark]: TraceAbstraction took 593.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 961.1 MB in the end (delta: 88.6 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:12:03,337 INFO L168 Benchmark]: Witness Printer took 49.34 ms. Allocated memory is still 1.1 GB. Free memory was 961.1 MB in the beginning and 955.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:12:03,338 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 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 184.07 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 87.6 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -143.0 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 25.38 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.94 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 290.54 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 32.6 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 593.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 961.1 MB in the end (delta: 88.6 MB). Peak memory consumption was 88.6 MB. Max. memory is 11.5 GB. * Witness Printer took 49.34 ms. Allocated memory is still 1.1 GB. Free memory was 961.1 MB in the beginning and 955.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 133]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 24 locations, 1 error locations. Result: SAFE, OverallTime: 0.5s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 241 SDtfs, 202 SDslu, 344 SDs, 0 SdLazy, 72 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=0, 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, 8 MinimizatonAttempts, 84 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 9 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 2844 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 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...