./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/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 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 14:41:57,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 14:41:57,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 14:41:57,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 14:41:57,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 14:41:57,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 14:41:57,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 14:41:57,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 14:41:57,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 14:41:57,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 14:41:57,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 14:41:57,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 14:41:57,591 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 14:41:57,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 14:41:57,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 14:41:57,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 14:41:57,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 14:41:57,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 14:41:57,596 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 14:41:57,597 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 14:41:57,598 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 14:41:57,599 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 14:41:57,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 14:41:57,601 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 14:41:57,601 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 14:41:57,602 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 14:41:57,602 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 14:41:57,603 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 14:41:57,603 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 14:41:57,604 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 14:41:57,604 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 14:41:57,605 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 14:41:57,605 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 14:41:57,605 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 14:41:57,606 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 14:41:57,606 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 14:41:57,606 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 14:41:57,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 14:41:57,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 14:41:57,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 14:41:57,618 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 14:41:57,618 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 14:41:57,618 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 14:41:57,618 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 14:41:57,618 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 14:41:57,618 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 14:41:57,618 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 14:41:57,618 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 14:41:57,619 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 14:41:57,619 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 14:41:57,619 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 14:41:57,619 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 14:41:57,619 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 14:41:57,619 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 14:41:57,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 14:41:57,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 14:41:57,620 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 14:41:57,620 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 14:41:57,620 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 14:41:57,620 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 14:41:57,620 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 14:41:57,620 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 14:41:57,621 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 14:41:57,621 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 14:41:57,622 INFO L133 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/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/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 -> 4f33d015f37d4475f0ca85a8ea6311ffc3e89abb [2018-12-09 14:41:57,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 14:41:57,653 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 14:41:57,656 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 14:41:57,657 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 14:41:57,658 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 14:41:57,658 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 14:41:57,694 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/data/1721812d6/35e63ca949fd4f0e878185b647234ea7/FLAG183025e44 [2018-12-09 14:41:58,059 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 14:41:58,060 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/sv-benchmarks/c/locks/test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 14:41:58,064 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/data/1721812d6/35e63ca949fd4f0e878185b647234ea7/FLAG183025e44 [2018-12-09 14:41:58,072 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/data/1721812d6/35e63ca949fd4f0e878185b647234ea7 [2018-12-09 14:41:58,074 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 14:41:58,075 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 14:41:58,075 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 14:41:58,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 14:41:58,077 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 14:41:58,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27d92faf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58, skipping insertion in model container [2018-12-09 14:41:58,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,084 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 14:41:58,094 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 14:41:58,179 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:41:58,182 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 14:41:58,192 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 14:41:58,200 INFO L195 MainTranslator]: Completed translation [2018-12-09 14:41:58,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58 WrapperNode [2018-12-09 14:41:58,201 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 14:41:58,201 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 14:41:58,201 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 14:41:58,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 14:41:58,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,209 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,213 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 14:41:58,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 14:41:58,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 14:41:58,213 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 14:41:58,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,225 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... [2018-12-09 14:41:58,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 14:41:58,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 14:41:58,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 14:41:58,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 14:41:58,227 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/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 [2018-12-09 14:41:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 14:41:58,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 14:41:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 14:41:58,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 14:41:58,291 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 14:41:58,292 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 14:41:58,393 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 14:41:58,393 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 14:41:58,393 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:41:58 BoogieIcfgContainer [2018-12-09 14:41:58,393 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 14:41:58,394 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 14:41:58,394 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 14:41:58,395 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 14:41:58,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:41:58" (1/3) ... [2018-12-09 14:41:58,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247d12d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:41:58, skipping insertion in model container [2018-12-09 14:41:58,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:41:58" (2/3) ... [2018-12-09 14:41:58,396 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247d12d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:41:58, skipping insertion in model container [2018-12-09 14:41:58,396 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:41:58" (3/3) ... [2018-12-09 14:41:58,398 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_5_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 14:41:58,404 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 14:41:58,408 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 14:41:58,417 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 14:41:58,434 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 14:41:58,434 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 14:41:58,434 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 14:41:58,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 14:41:58,435 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 14:41:58,435 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 14:41:58,435 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 14:41:58,435 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 14:41:58,444 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-12-09 14:41:58,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 14:41:58,447 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,448 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,449 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,452 INFO L82 PathProgramCache]: Analyzing trace with hash 316328318, now seen corresponding path program 1 times [2018-12-09 14:41:58,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,553 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2018-12-09 14:41:58,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,576 INFO L93 Difference]: Finished difference Result 57 states and 90 transitions. [2018-12-09 14:41:58,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 14:41:58,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,583 INFO L225 Difference]: With dead ends: 57 [2018-12-09 14:41:58,583 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 14:41:58,585 INFO L631 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 [2018-12-09 14:41:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 14:41:58,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2018-12-09 14:41:58,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 14:41:58,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 49 transitions. [2018-12-09 14:41:58,606 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 49 transitions. Word has length 15 [2018-12-09 14:41:58,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,607 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 49 transitions. [2018-12-09 14:41:58,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,607 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 49 transitions. [2018-12-09 14:41:58,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 14:41:58,607 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,607 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,608 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,608 INFO L82 PathProgramCache]: Analyzing trace with hash -493018308, now seen corresponding path program 1 times [2018-12-09 14:41:58,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,634 INFO L87 Difference]: Start difference. First operand 30 states and 49 transitions. Second operand 3 states. [2018-12-09 14:41:58,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,649 INFO L93 Difference]: Finished difference Result 67 states and 112 transitions. [2018-12-09 14:41:58,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 14:41:58,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,650 INFO L225 Difference]: With dead ends: 67 [2018-12-09 14:41:58,650 INFO L226 Difference]: Without dead ends: 42 [2018-12-09 14:41:58,650 INFO L631 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 [2018-12-09 14:41:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-09 14:41:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2018-12-09 14:41:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 14:41:58,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 65 transitions. [2018-12-09 14:41:58,654 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 65 transitions. Word has length 15 [2018-12-09 14:41:58,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,654 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 65 transitions. [2018-12-09 14:41:58,654 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,654 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 65 transitions. [2018-12-09 14:41:58,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 14:41:58,654 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,654 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,655 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1216458266, now seen corresponding path program 1 times [2018-12-09 14:41:58,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,656 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,673 INFO L87 Difference]: Start difference. First operand 40 states and 65 transitions. Second operand 3 states. [2018-12-09 14:41:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,683 INFO L93 Difference]: Finished difference Result 63 states and 99 transitions. [2018-12-09 14:41:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,683 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-09 14:41:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,683 INFO L225 Difference]: With dead ends: 63 [2018-12-09 14:41:58,683 INFO L226 Difference]: Without dead ends: 45 [2018-12-09 14:41:58,684 INFO L631 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 [2018-12-09 14:41:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-12-09 14:41:58,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2018-12-09 14:41:58,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 14:41:58,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 67 transitions. [2018-12-09 14:41:58,687 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 67 transitions. Word has length 16 [2018-12-09 14:41:58,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,687 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 67 transitions. [2018-12-09 14:41:58,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,687 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 67 transitions. [2018-12-09 14:41:58,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 14:41:58,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,688 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,688 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1896516636, now seen corresponding path program 1 times [2018-12-09 14:41:58,688 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,689 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,712 INFO L87 Difference]: Start difference. First operand 43 states and 67 transitions. Second operand 3 states. [2018-12-09 14:41:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,721 INFO L93 Difference]: Finished difference Result 76 states and 120 transitions. [2018-12-09 14:41:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-09 14:41:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,722 INFO L225 Difference]: With dead ends: 76 [2018-12-09 14:41:58,722 INFO L226 Difference]: Without dead ends: 74 [2018-12-09 14:41:58,723 INFO L631 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 [2018-12-09 14:41:58,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-09 14:41:58,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 56. [2018-12-09 14:41:58,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-09 14:41:58,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 88 transitions. [2018-12-09 14:41:58,727 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 88 transitions. Word has length 16 [2018-12-09 14:41:58,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,727 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 88 transitions. [2018-12-09 14:41:58,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,727 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 88 transitions. [2018-12-09 14:41:58,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-09 14:41:58,727 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,727 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,728 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1087170010, now seen corresponding path program 1 times [2018-12-09 14:41:58,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,745 INFO L87 Difference]: Start difference. First operand 56 states and 88 transitions. Second operand 3 states. [2018-12-09 14:41:58,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,754 INFO L93 Difference]: Finished difference Result 124 states and 198 transitions. [2018-12-09 14:41:58,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-09 14:41:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,755 INFO L225 Difference]: With dead ends: 124 [2018-12-09 14:41:58,755 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 14:41:58,756 INFO L631 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 [2018-12-09 14:41:58,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 14:41:58,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2018-12-09 14:41:58,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-09 14:41:58,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 114 transitions. [2018-12-09 14:41:58,760 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 114 transitions. Word has length 16 [2018-12-09 14:41:58,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,760 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 114 transitions. [2018-12-09 14:41:58,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 114 transitions. [2018-12-09 14:41:58,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 14:41:58,761 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,761 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,761 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1337311087, now seen corresponding path program 1 times [2018-12-09 14:41:58,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,775 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,776 INFO L87 Difference]: Start difference. First operand 74 states and 114 transitions. Second operand 3 states. [2018-12-09 14:41:58,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,789 INFO L93 Difference]: Finished difference Result 111 states and 169 transitions. [2018-12-09 14:41:58,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 14:41:58,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,790 INFO L225 Difference]: With dead ends: 111 [2018-12-09 14:41:58,790 INFO L226 Difference]: Without dead ends: 78 [2018-12-09 14:41:58,790 INFO L631 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 [2018-12-09 14:41:58,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-12-09 14:41:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-12-09 14:41:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-12-09 14:41:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 114 transitions. [2018-12-09 14:41:58,795 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 114 transitions. Word has length 17 [2018-12-09 14:41:58,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,795 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 114 transitions. [2018-12-09 14:41:58,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,795 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 114 transitions. [2018-12-09 14:41:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 14:41:58,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,795 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,796 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,796 INFO L82 PathProgramCache]: Analyzing trace with hash -657252717, now seen corresponding path program 1 times [2018-12-09 14:41:58,796 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,816 INFO L87 Difference]: Start difference. First operand 76 states and 114 transitions. Second operand 3 states. [2018-12-09 14:41:58,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,826 INFO L93 Difference]: Finished difference Result 132 states and 200 transitions. [2018-12-09 14:41:58,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 14:41:58,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,828 INFO L225 Difference]: With dead ends: 132 [2018-12-09 14:41:58,828 INFO L226 Difference]: Without dead ends: 130 [2018-12-09 14:41:58,828 INFO L631 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 [2018-12-09 14:41:58,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-12-09 14:41:58,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 104. [2018-12-09 14:41:58,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-09 14:41:58,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2018-12-09 14:41:58,836 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 17 [2018-12-09 14:41:58,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,837 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2018-12-09 14:41:58,837 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2018-12-09 14:41:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 14:41:58,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,838 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1466599343, now seen corresponding path program 1 times [2018-12-09 14:41:58,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,854 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 3 states. [2018-12-09 14:41:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,869 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2018-12-09 14:41:58,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-09 14:41:58,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,870 INFO L225 Difference]: With dead ends: 232 [2018-12-09 14:41:58,870 INFO L226 Difference]: Without dead ends: 138 [2018-12-09 14:41:58,870 INFO L631 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 [2018-12-09 14:41:58,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-12-09 14:41:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 136. [2018-12-09 14:41:58,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-09 14:41:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 194 transitions. [2018-12-09 14:41:58,880 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 194 transitions. Word has length 17 [2018-12-09 14:41:58,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,880 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 194 transitions. [2018-12-09 14:41:58,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 194 transitions. [2018-12-09 14:41:58,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 14:41:58,881 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,881 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,881 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,881 INFO L82 PathProgramCache]: Analyzing trace with hash 1100217935, now seen corresponding path program 1 times [2018-12-09 14:41:58,882 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,900 INFO L87 Difference]: Start difference. First operand 136 states and 194 transitions. Second operand 3 states. [2018-12-09 14:41:58,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,912 INFO L93 Difference]: Finished difference Result 204 states and 288 transitions. [2018-12-09 14:41:58,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 14:41:58,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,913 INFO L225 Difference]: With dead ends: 204 [2018-12-09 14:41:58,913 INFO L226 Difference]: Without dead ends: 142 [2018-12-09 14:41:58,914 INFO L631 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 [2018-12-09 14:41:58,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-12-09 14:41:58,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-12-09 14:41:58,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-09 14:41:58,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 194 transitions. [2018-12-09 14:41:58,921 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 194 transitions. Word has length 18 [2018-12-09 14:41:58,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,922 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 194 transitions. [2018-12-09 14:41:58,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,922 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 194 transitions. [2018-12-09 14:41:58,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 14:41:58,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,923 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1780276305, now seen corresponding path program 1 times [2018-12-09 14:41:58,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,941 INFO L87 Difference]: Start difference. First operand 140 states and 194 transitions. Second operand 3 states. [2018-12-09 14:41:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:58,954 INFO L93 Difference]: Finished difference Result 236 states and 328 transitions. [2018-12-09 14:41:58,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:58,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 14:41:58,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:58,955 INFO L225 Difference]: With dead ends: 236 [2018-12-09 14:41:58,956 INFO L226 Difference]: Without dead ends: 234 [2018-12-09 14:41:58,956 INFO L631 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 [2018-12-09 14:41:58,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-12-09 14:41:58,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 200. [2018-12-09 14:41:58,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-09 14:41:58,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 270 transitions. [2018-12-09 14:41:58,966 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 270 transitions. Word has length 18 [2018-12-09 14:41:58,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:58,967 INFO L480 AbstractCegarLoop]: Abstraction has 200 states and 270 transitions. [2018-12-09 14:41:58,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:58,967 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 270 transitions. [2018-12-09 14:41:58,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-09 14:41:58,968 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:58,968 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:58,968 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:58,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:58,969 INFO L82 PathProgramCache]: Analyzing trace with hash 970929679, now seen corresponding path program 1 times [2018-12-09 14:41:58,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:58,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:58,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:58,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:58,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:58,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:58,987 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:58,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:58,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:58,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:58,988 INFO L87 Difference]: Start difference. First operand 200 states and 270 transitions. Second operand 3 states. [2018-12-09 14:41:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:59,001 INFO L93 Difference]: Finished difference Result 444 states and 592 transitions. [2018-12-09 14:41:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:59,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-09 14:41:59,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:59,002 INFO L225 Difference]: With dead ends: 444 [2018-12-09 14:41:59,002 INFO L226 Difference]: Without dead ends: 258 [2018-12-09 14:41:59,003 INFO L631 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 [2018-12-09 14:41:59,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-12-09 14:41:59,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2018-12-09 14:41:59,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-12-09 14:41:59,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 326 transitions. [2018-12-09 14:41:59,013 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 326 transitions. Word has length 18 [2018-12-09 14:41:59,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:59,013 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 326 transitions. [2018-12-09 14:41:59,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:59,013 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 326 transitions. [2018-12-09 14:41:59,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 14:41:59,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:59,014 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:59,014 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:59,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:59,015 INFO L82 PathProgramCache]: Analyzing trace with hash -645793370, now seen corresponding path program 1 times [2018-12-09 14:41:59,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:59,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:59,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:59,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:59,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:59,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:59,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:59,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:59,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:59,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:59,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:59,028 INFO L87 Difference]: Start difference. First operand 256 states and 326 transitions. Second operand 3 states. [2018-12-09 14:41:59,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:59,041 INFO L93 Difference]: Finished difference Result 384 states and 484 transitions. [2018-12-09 14:41:59,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:59,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 14:41:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:59,042 INFO L225 Difference]: With dead ends: 384 [2018-12-09 14:41:59,042 INFO L226 Difference]: Without dead ends: 266 [2018-12-09 14:41:59,043 INFO L631 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 [2018-12-09 14:41:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-12-09 14:41:59,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-12-09 14:41:59,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-09 14:41:59,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 326 transitions. [2018-12-09 14:41:59,049 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 326 transitions. Word has length 19 [2018-12-09 14:41:59,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:59,050 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 326 transitions. [2018-12-09 14:41:59,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 326 transitions. [2018-12-09 14:41:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 14:41:59,050 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:59,050 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:59,050 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:59,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:59,050 INFO L82 PathProgramCache]: Analyzing trace with hash 34265000, now seen corresponding path program 1 times [2018-12-09 14:41:59,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:59,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:59,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:59,051 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:59,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:59,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:59,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:59,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:59,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:59,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:59,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:59,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:59,060 INFO L87 Difference]: Start difference. First operand 264 states and 326 transitions. Second operand 3 states. [2018-12-09 14:41:59,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:59,074 INFO L93 Difference]: Finished difference Result 426 states and 519 transitions. [2018-12-09 14:41:59,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:59,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 14:41:59,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:59,076 INFO L225 Difference]: With dead ends: 426 [2018-12-09 14:41:59,076 INFO L226 Difference]: Without dead ends: 424 [2018-12-09 14:41:59,076 INFO L631 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 [2018-12-09 14:41:59,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2018-12-09 14:41:59,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 392. [2018-12-09 14:41:59,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-12-09 14:41:59,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 470 transitions. [2018-12-09 14:41:59,087 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 470 transitions. Word has length 19 [2018-12-09 14:41:59,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:59,088 INFO L480 AbstractCegarLoop]: Abstraction has 392 states and 470 transitions. [2018-12-09 14:41:59,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:59,088 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 470 transitions. [2018-12-09 14:41:59,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-09 14:41:59,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 14:41:59,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 14:41:59,089 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 14:41:59,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 14:41:59,089 INFO L82 PathProgramCache]: Analyzing trace with hash -775081626, now seen corresponding path program 1 times [2018-12-09 14:41:59,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 14:41:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:59,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 14:41:59,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 14:41:59,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 14:41:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 14:41:59,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 14:41:59,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 14:41:59,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 14:41:59,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 14:41:59,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 14:41:59,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 14:41:59,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 14:41:59,100 INFO L87 Difference]: Start difference. First operand 392 states and 470 transitions. Second operand 3 states. [2018-12-09 14:41:59,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 14:41:59,120 INFO L93 Difference]: Finished difference Result 856 states and 998 transitions. [2018-12-09 14:41:59,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 14:41:59,120 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-09 14:41:59,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 14:41:59,121 INFO L225 Difference]: With dead ends: 856 [2018-12-09 14:41:59,121 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 14:41:59,122 INFO L631 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 [2018-12-09 14:41:59,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 14:41:59,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 14:41:59,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 14:41:59,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 14:41:59,123 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2018-12-09 14:41:59,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 14:41:59,123 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 14:41:59,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 14:41:59,123 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 14:41:59,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 14:41:59,127 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 14:41:59,141 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 14:41:59,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 14:41:59,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 14:41:59,141 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 14:41:59,141 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 14:41:59,141 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 14:41:59,141 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-12-09 14:41:59,141 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 91) no Hoare annotation was computed. [2018-12-09 14:41:59,141 INFO L451 ceAbstractionStarter]: At program point L89(lines 5 93) the Hoare annotation is: true [2018-12-09 14:41:59,141 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 93) no Hoare annotation was computed. [2018-12-09 14:41:59,141 INFO L448 ceAbstractionStarter]: For program point L73-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L53-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L49-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L41-2(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L451 ceAbstractionStarter]: At program point L83-1(lines 24 88) the Hoare annotation is: true [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 93) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 93) the Hoare annotation is: true [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L26(lines 26 28) no Hoare annotation was computed. [2018-12-09 14:41:59,142 INFO L448 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-12-09 14:41:59,143 INFO L444 ceAbstractionStarter]: At program point L84-1(lines 5 93) the Hoare annotation is: false [2018-12-09 14:41:59,143 INFO L448 ceAbstractionStarter]: For program point L68-1(lines 24 88) no Hoare annotation was computed. [2018-12-09 14:41:59,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:41:59 BoogieIcfgContainer [2018-12-09 14:41:59,146 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 14:41:59,146 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 14:41:59,147 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 14:41:59,147 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 14:41:59,147 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:41:58" (3/4) ... [2018-12-09 14:41:59,149 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 14:41:59,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 14:41:59,153 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 14:41:59,156 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 14:41:59,156 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 14:41:59,156 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 14:41:59,187 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0ac5b2e0-5924-433a-bcea-e49c0300d519/bin-2019/utaipan/witness.graphml [2018-12-09 14:41:59,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 14:41:59,187 INFO L168 Benchmark]: Toolchain (without parser) took 1113.09 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 954.4 MB in the beginning and 933.5 MB in the end (delta: 20.9 MB). Peak memory consumption was 114.2 MB. Max. memory is 11.5 GB. [2018-12-09 14:41:59,188 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:41:59,188 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.47 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 14:41:59,188 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.81 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 14:41:59,189 INFO L168 Benchmark]: Boogie Preprocessor took 13.45 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 939.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. [2018-12-09 14:41:59,189 INFO L168 Benchmark]: RCFGBuilder took 166.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. [2018-12-09 14:41:59,189 INFO L168 Benchmark]: TraceAbstraction took 752.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 938.9 MB in the end (delta: 138.0 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. [2018-12-09 14:41:59,189 INFO L168 Benchmark]: Witness Printer took 40.29 ms. Allocated memory is still 1.1 GB. Free memory was 938.9 MB in the beginning and 933.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 14:41:59,190 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.47 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 943.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.81 ms. Allocated memory is still 1.0 GB. Free memory is still 943.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.45 ms. Allocated memory is still 1.0 GB. Free memory was 943.6 MB in the beginning and 939.9 MB in the end (delta: 3.8 MB). Peak memory consumption was 3.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 166.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.3 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -137.0 MB). Peak memory consumption was 13.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 752.57 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 938.9 MB in the end (delta: 138.0 MB). Peak memory consumption was 138.0 MB. Max. memory is 11.5 GB. * Witness Printer took 40.29 ms. Allocated memory is still 1.1 GB. Free memory was 938.9 MB in the beginning and 933.5 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: 91]: 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: 24]: 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 3 procedures, 29 locations, 1 error locations. SAFE Result, 0.7s OverallTime, 14 OverallIterations, 1 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 654 SDtfs, 285 SDslu, 428 SDs, 0 SdLazy, 75 SolverSat, 14 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=392occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 14 MinimizatonAttempts, 138 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 42 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 226 ConstructedInterpolants, 0 QuantifiedInterpolants, 6424 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...