./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_6_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_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/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 fc492c809d432e4c3053fa8c39191c1c15ea4eea ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 06:51:39,578 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:51:39,580 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:51:39,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:51:39,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:51:39,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:51:39,587 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:51:39,589 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:51:39,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:51:39,590 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:51:39,591 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:51:39,591 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:51:39,592 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:51:39,593 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:51:39,594 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:51:39,594 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:51:39,595 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:51:39,596 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:51:39,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:51:39,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:51:39,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:51:39,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:51:39,602 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:51:39,603 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:51:39,603 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:51:39,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:51:39,604 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:51:39,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:51:39,605 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:51:39,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:51:39,606 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:51:39,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:51:39,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:51:39,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:51:39,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:51:39,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:51:39,609 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 06:51:39,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:51:39,618 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:51:39,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:51:39,618 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:51:39,618 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:51:39,619 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:51:39,619 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:51:39,619 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:51:39,619 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:51:39,619 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:51:39,619 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:51:39,619 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:51:39,619 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:51:39,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:51:39,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:51:39,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:51:39,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:51:39,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:51:39,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 06:51:39,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:51:39,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 06:51:39,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:51:39,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 06:51:39,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 06:51:39,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:51:39,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:51:39,622 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:51:39,622 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:51:39,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:51:39,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:51:39,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:51:39,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 06:51:39,622 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:51:39,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:51:39,623 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:51:39,623 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 06:51:39,623 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_689dac78-f711-4882-8ca1-2ecc3de6df3b/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 -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-12-03 06:51:39,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:51:39,650 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:51:39,652 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:51:39,653 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:51:39,654 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:51:39,654 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-03 06:51:39,691 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/data/051b8cd71/c015b26c3deb45529ec443851da7959e/FLAG56ee75905 [2018-12-03 06:51:40,106 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:51:40,106 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-03 06:51:40,110 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/data/051b8cd71/c015b26c3deb45529ec443851da7959e/FLAG56ee75905 [2018-12-03 06:51:40,118 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/data/051b8cd71/c015b26c3deb45529ec443851da7959e [2018-12-03 06:51:40,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:51:40,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:51:40,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:51:40,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:51:40,124 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:51:40,124 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,125 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2caf47c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40, skipping insertion in model container [2018-12-03 06:51:40,126 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,130 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:51:40,140 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:51:40,223 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:51:40,225 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:51:40,237 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:51:40,245 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:51:40,245 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40 WrapperNode [2018-12-03 06:51:40,245 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:51:40,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:51:40,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:51:40,246 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:51:40,250 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,254 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:51:40,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:51:40,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:51:40,258 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:51:40,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,263 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,264 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,299 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... [2018-12-03 06:51:40,300 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:51:40,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:51:40,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:51:40,301 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:51:40,302 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/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-03 06:51:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 06:51:40,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 06:51:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:51:40,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:51:40,338 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 06:51:40,338 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 06:51:40,460 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:51:40,460 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 06:51:40,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:51:40 BoogieIcfgContainer [2018-12-03 06:51:40,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:51:40,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:51:40,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:51:40,463 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:51:40,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:51:40" (1/3) ... [2018-12-03 06:51:40,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e51aba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:51:40, skipping insertion in model container [2018-12-03 06:51:40,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:51:40" (2/3) ... [2018-12-03 06:51:40,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e51aba1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:51:40, skipping insertion in model container [2018-12-03 06:51:40,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:51:40" (3/3) ... [2018-12-03 06:51:40,465 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-03 06:51:40,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:51:40,476 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 06:51:40,486 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 06:51:40,504 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:51:40,504 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 06:51:40,504 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:51:40,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:51:40,505 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:51:40,505 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:51:40,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:51:40,505 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:51:40,515 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-03 06:51:40,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 06:51:40,519 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,519 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:40,520 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash 429652513, now seen corresponding path program 1 times [2018-12-03 06:51:40,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,556 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,617 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-03 06:51:40,618 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,631 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-12-03 06:51:40,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,657 INFO L93 Difference]: Finished difference Result 63 states and 102 transitions. [2018-12-03 06:51:40,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 06:51:40,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,664 INFO L225 Difference]: With dead ends: 63 [2018-12-03 06:51:40,665 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 06:51:40,666 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-03 06:51:40,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 06:51:40,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2018-12-03 06:51:40,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 06:51:40,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-12-03 06:51:40,689 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 16 [2018-12-03 06:51:40,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,689 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-12-03 06:51:40,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-12-03 06:51:40,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 06:51:40,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,690 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:40,690 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1109710883, now seen corresponding path program 1 times [2018-12-03 06:51:40,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,716 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-03 06:51:40,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,717 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-12-03 06:51:40,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,733 INFO L93 Difference]: Finished difference Result 77 states and 132 transitions. [2018-12-03 06:51:40,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,734 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-12-03 06:51:40,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,734 INFO L225 Difference]: With dead ends: 77 [2018-12-03 06:51:40,734 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 06:51:40,735 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-03 06:51:40,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 06:51:40,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2018-12-03 06:51:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-03 06:51:40,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 77 transitions. [2018-12-03 06:51:40,738 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 77 transitions. Word has length 16 [2018-12-03 06:51:40,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,739 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 77 transitions. [2018-12-03 06:51:40,739 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 77 transitions. [2018-12-03 06:51:40,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 06:51:40,739 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,739 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:40,739 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,740 INFO L82 PathProgramCache]: Analyzing trace with hash 434540691, now seen corresponding path program 1 times [2018-12-03 06:51:40,740 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,759 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-03 06:51:40,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,760 INFO L87 Difference]: Start difference. First operand 46 states and 77 transitions. Second operand 3 states. [2018-12-03 06:51:40,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,769 INFO L93 Difference]: Finished difference Result 72 states and 117 transitions. [2018-12-03 06:51:40,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 06:51:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,769 INFO L225 Difference]: With dead ends: 72 [2018-12-03 06:51:40,769 INFO L226 Difference]: Without dead ends: 51 [2018-12-03 06:51:40,770 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-03 06:51:40,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-03 06:51:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2018-12-03 06:51:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 06:51:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2018-12-03 06:51:40,773 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 17 [2018-12-03 06:51:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,773 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2018-12-03 06:51:40,773 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2018-12-03 06:51:40,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 06:51:40,774 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:40,774 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,774 INFO L82 PathProgramCache]: Analyzing trace with hash 41513681, now seen corresponding path program 1 times [2018-12-03 06:51:40,774 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,775 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,775 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,790 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-03 06:51:40,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,790 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,791 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 3 states. [2018-12-03 06:51:40,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,800 INFO L93 Difference]: Finished difference Result 88 states and 144 transitions. [2018-12-03 06:51:40,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 06:51:40,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,801 INFO L225 Difference]: With dead ends: 88 [2018-12-03 06:51:40,801 INFO L226 Difference]: Without dead ends: 86 [2018-12-03 06:51:40,802 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-03 06:51:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-12-03 06:51:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2018-12-03 06:51:40,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-03 06:51:40,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 104 transitions. [2018-12-03 06:51:40,806 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 104 transitions. Word has length 17 [2018-12-03 06:51:40,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,806 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 104 transitions. [2018-12-03 06:51:40,806 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,806 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 104 transitions. [2018-12-03 06:51:40,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 06:51:40,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,806 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:40,807 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,807 INFO L82 PathProgramCache]: Analyzing trace with hash 721572051, now seen corresponding path program 1 times [2018-12-03 06:51:40,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,821 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-03 06:51:40,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,822 INFO L87 Difference]: Start difference. First operand 64 states and 104 transitions. Second operand 3 states. [2018-12-03 06:51:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,835 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2018-12-03 06:51:40,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,835 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-12-03 06:51:40,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,836 INFO L225 Difference]: With dead ends: 144 [2018-12-03 06:51:40,836 INFO L226 Difference]: Without dead ends: 88 [2018-12-03 06:51:40,836 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-03 06:51:40,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-12-03 06:51:40,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 86. [2018-12-03 06:51:40,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-12-03 06:51:40,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 138 transitions. [2018-12-03 06:51:40,841 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 138 transitions. Word has length 17 [2018-12-03 06:51:40,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,841 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 138 transitions. [2018-12-03 06:51:40,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,841 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 138 transitions. [2018-12-03 06:51:40,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 06:51:40,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,841 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-03 06:51:40,841 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1287139128, now seen corresponding path program 1 times [2018-12-03 06:51:40,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,842 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,860 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-03 06:51:40,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,861 INFO L87 Difference]: Start difference. First operand 86 states and 138 transitions. Second operand 3 states. [2018-12-03 06:51:40,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,870 INFO L93 Difference]: Finished difference Result 129 states and 205 transitions. [2018-12-03 06:51:40,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 06:51:40,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,872 INFO L225 Difference]: With dead ends: 129 [2018-12-03 06:51:40,872 INFO L226 Difference]: Without dead ends: 90 [2018-12-03 06:51:40,872 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-03 06:51:40,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-12-03 06:51:40,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-12-03 06:51:40,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-12-03 06:51:40,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 138 transitions. [2018-12-03 06:51:40,878 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 138 transitions. Word has length 18 [2018-12-03 06:51:40,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,879 INFO L480 AbstractCegarLoop]: Abstraction has 88 states and 138 transitions. [2018-12-03 06:51:40,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,879 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 138 transitions. [2018-12-03 06:51:40,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 06:51:40,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,879 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-03 06:51:40,879 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,880 INFO L82 PathProgramCache]: Analyzing trace with hash 894112118, now seen corresponding path program 1 times [2018-12-03 06:51:40,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,881 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,881 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,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-03 06:51:40,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,900 INFO L87 Difference]: Start difference. First operand 88 states and 138 transitions. Second operand 3 states. [2018-12-03 06:51:40,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,910 INFO L93 Difference]: Finished difference Result 156 states and 248 transitions. [2018-12-03 06:51:40,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 06:51:40,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,911 INFO L225 Difference]: With dead ends: 156 [2018-12-03 06:51:40,911 INFO L226 Difference]: Without dead ends: 154 [2018-12-03 06:51:40,912 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-03 06:51:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-12-03 06:51:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 120. [2018-12-03 06:51:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-12-03 06:51:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 186 transitions. [2018-12-03 06:51:40,917 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 186 transitions. Word has length 18 [2018-12-03 06:51:40,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,917 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 186 transitions. [2018-12-03 06:51:40,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 186 transitions. [2018-12-03 06:51:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-03 06:51:40,918 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,918 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-03 06:51:40,918 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1574170488, now seen corresponding path program 1 times [2018-12-03 06:51:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,920 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,935 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-03 06:51:40,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,935 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,936 INFO L87 Difference]: Start difference. First operand 120 states and 186 transitions. Second operand 3 states. [2018-12-03 06:51:40,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,953 INFO L93 Difference]: Finished difference Result 272 states and 424 transitions. [2018-12-03 06:51:40,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-03 06:51:40,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,954 INFO L225 Difference]: With dead ends: 272 [2018-12-03 06:51:40,955 INFO L226 Difference]: Without dead ends: 162 [2018-12-03 06:51:40,955 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-03 06:51:40,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-03 06:51:40,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2018-12-03 06:51:40,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-12-03 06:51:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 242 transitions. [2018-12-03 06:51:40,965 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 242 transitions. Word has length 18 [2018-12-03 06:51:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:40,965 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 242 transitions. [2018-12-03 06:51:40,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 242 transitions. [2018-12-03 06:51:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 06:51:40,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:40,966 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-03 06:51:40,967 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:40,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:40,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1947887240, now seen corresponding path program 1 times [2018-12-03 06:51:40,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:40,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:40,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:40,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:40,980 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-03 06:51:40,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:40,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:40,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:40,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:40,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:40,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:40,981 INFO L87 Difference]: Start difference. First operand 160 states and 242 transitions. Second operand 3 states. [2018-12-03 06:51:40,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:40,996 INFO L93 Difference]: Finished difference Result 240 states and 360 transitions. [2018-12-03 06:51:40,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:40,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 06:51:40,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:40,997 INFO L225 Difference]: With dead ends: 240 [2018-12-03 06:51:40,997 INFO L226 Difference]: Without dead ends: 166 [2018-12-03 06:51:40,998 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-03 06:51:40,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-03 06:51:41,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-12-03 06:51:41,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-12-03 06:51:41,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 242 transitions. [2018-12-03 06:51:41,004 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 242 transitions. Word has length 19 [2018-12-03 06:51:41,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,004 INFO L480 AbstractCegarLoop]: Abstraction has 164 states and 242 transitions. [2018-12-03 06:51:41,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,004 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 242 transitions. [2018-12-03 06:51:41,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 06:51:41,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,005 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-03 06:51:41,005 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1554860230, now seen corresponding path program 1 times [2018-12-03 06:51:41,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,006 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,019 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-03 06:51:41,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,020 INFO L87 Difference]: Start difference. First operand 164 states and 242 transitions. Second operand 3 states. [2018-12-03 06:51:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,034 INFO L93 Difference]: Finished difference Result 284 states and 424 transitions. [2018-12-03 06:51:41,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,035 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 06:51:41,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,036 INFO L225 Difference]: With dead ends: 284 [2018-12-03 06:51:41,036 INFO L226 Difference]: Without dead ends: 282 [2018-12-03 06:51:41,036 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-03 06:51:41,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-12-03 06:51:41,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 232. [2018-12-03 06:51:41,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 232 states. [2018-12-03 06:51:41,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 334 transitions. [2018-12-03 06:51:41,045 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 334 transitions. Word has length 19 [2018-12-03 06:51:41,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,045 INFO L480 AbstractCegarLoop]: Abstraction has 232 states and 334 transitions. [2018-12-03 06:51:41,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,045 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 334 transitions. [2018-12-03 06:51:41,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-12-03 06:51:41,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,046 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-03 06:51:41,047 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,047 INFO L82 PathProgramCache]: Analyzing trace with hash -2060048696, now seen corresponding path program 1 times [2018-12-03 06:51:41,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,062 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-03 06:51:41,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,063 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,063 INFO L87 Difference]: Start difference. First operand 232 states and 334 transitions. Second operand 3 states. [2018-12-03 06:51:41,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,079 INFO L93 Difference]: Finished difference Result 524 states and 752 transitions. [2018-12-03 06:51:41,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-12-03 06:51:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,080 INFO L225 Difference]: With dead ends: 524 [2018-12-03 06:51:41,080 INFO L226 Difference]: Without dead ends: 306 [2018-12-03 06:51:41,080 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-03 06:51:41,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-12-03 06:51:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 304. [2018-12-03 06:51:41,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304 states. [2018-12-03 06:51:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 422 transitions. [2018-12-03 06:51:41,089 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 422 transitions. Word has length 19 [2018-12-03 06:51:41,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,090 INFO L480 AbstractCegarLoop]: Abstraction has 304 states and 422 transitions. [2018-12-03 06:51:41,090 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 422 transitions. [2018-12-03 06:51:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 06:51:41,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:41,091 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,091 INFO L82 PathProgramCache]: Analyzing trace with hash 956242573, now seen corresponding path program 1 times [2018-12-03 06:51:41,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,092 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,103 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-03 06:51:41,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,103 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,103 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,104 INFO L87 Difference]: Start difference. First operand 304 states and 422 transitions. Second operand 3 states. [2018-12-03 06:51:41,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,114 INFO L93 Difference]: Finished difference Result 456 states and 628 transitions. [2018-12-03 06:51:41,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,115 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 06:51:41,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,116 INFO L225 Difference]: With dead ends: 456 [2018-12-03 06:51:41,116 INFO L226 Difference]: Without dead ends: 314 [2018-12-03 06:51:41,116 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-03 06:51:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-12-03 06:51:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-12-03 06:51:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-12-03 06:51:41,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 422 transitions. [2018-12-03 06:51:41,126 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 422 transitions. Word has length 20 [2018-12-03 06:51:41,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,126 INFO L480 AbstractCegarLoop]: Abstraction has 312 states and 422 transitions. [2018-12-03 06:51:41,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,127 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 422 transitions. [2018-12-03 06:51:41,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 06:51:41,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:41,127 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,127 INFO L82 PathProgramCache]: Analyzing trace with hash 563215563, now seen corresponding path program 1 times [2018-12-03 06:51:41,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,140 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-03 06:51:41,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,140 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,141 INFO L87 Difference]: Start difference. First operand 312 states and 422 transitions. Second operand 3 states. [2018-12-03 06:51:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,154 INFO L93 Difference]: Finished difference Result 524 states and 712 transitions. [2018-12-03 06:51:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 06:51:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,156 INFO L225 Difference]: With dead ends: 524 [2018-12-03 06:51:41,156 INFO L226 Difference]: Without dead ends: 522 [2018-12-03 06:51:41,156 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-03 06:51:41,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-12-03 06:51:41,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 456. [2018-12-03 06:51:41,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2018-12-03 06:51:41,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 598 transitions. [2018-12-03 06:51:41,169 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 598 transitions. Word has length 20 [2018-12-03 06:51:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,169 INFO L480 AbstractCegarLoop]: Abstraction has 456 states and 598 transitions. [2018-12-03 06:51:41,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 598 transitions. [2018-12-03 06:51:41,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 06:51:41,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,170 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:41,170 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1243273933, now seen corresponding path program 1 times [2018-12-03 06:51:41,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,183 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-03 06:51:41,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,185 INFO L87 Difference]: Start difference. First operand 456 states and 598 transitions. Second operand 3 states. [2018-12-03 06:51:41,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,208 INFO L93 Difference]: Finished difference Result 1020 states and 1320 transitions. [2018-12-03 06:51:41,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-03 06:51:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,210 INFO L225 Difference]: With dead ends: 1020 [2018-12-03 06:51:41,210 INFO L226 Difference]: Without dead ends: 586 [2018-12-03 06:51:41,211 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-03 06:51:41,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2018-12-03 06:51:41,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 584. [2018-12-03 06:51:41,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 584 states. [2018-12-03 06:51:41,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 584 states to 584 states and 726 transitions. [2018-12-03 06:51:41,232 INFO L78 Accepts]: Start accepts. Automaton has 584 states and 726 transitions. Word has length 20 [2018-12-03 06:51:41,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,233 INFO L480 AbstractCegarLoop]: Abstraction has 584 states and 726 transitions. [2018-12-03 06:51:41,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,233 INFO L276 IsEmpty]: Start isEmpty. Operand 584 states and 726 transitions. [2018-12-03 06:51:41,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 06:51:41,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,234 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:41,234 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,235 INFO L82 PathProgramCache]: Analyzing trace with hash 280029309, now seen corresponding path program 1 times [2018-12-03 06:51:41,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,247 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-03 06:51:41,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,248 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,248 INFO L87 Difference]: Start difference. First operand 584 states and 726 transitions. Second operand 3 states. [2018-12-03 06:51:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,270 INFO L93 Difference]: Finished difference Result 876 states and 1080 transitions. [2018-12-03 06:51:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-03 06:51:41,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,272 INFO L225 Difference]: With dead ends: 876 [2018-12-03 06:51:41,272 INFO L226 Difference]: Without dead ends: 602 [2018-12-03 06:51:41,273 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-03 06:51:41,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2018-12-03 06:51:41,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 600. [2018-12-03 06:51:41,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-12-03 06:51:41,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 726 transitions. [2018-12-03 06:51:41,294 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 726 transitions. Word has length 21 [2018-12-03 06:51:41,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,294 INFO L480 AbstractCegarLoop]: Abstraction has 600 states and 726 transitions. [2018-12-03 06:51:41,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,294 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 726 transitions. [2018-12-03 06:51:41,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 06:51:41,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,296 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:41,296 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,296 INFO L82 PathProgramCache]: Analyzing trace with hash -112997701, now seen corresponding path program 1 times [2018-12-03 06:51:41,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,297 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,308 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-03 06:51:41,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,308 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,309 INFO L87 Difference]: Start difference. First operand 600 states and 726 transitions. Second operand 3 states. [2018-12-03 06:51:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,337 INFO L93 Difference]: Finished difference Result 970 states and 1159 transitions. [2018-12-03 06:51:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,338 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-03 06:51:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,340 INFO L225 Difference]: With dead ends: 970 [2018-12-03 06:51:41,340 INFO L226 Difference]: Without dead ends: 968 [2018-12-03 06:51:41,341 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-03 06:51:41,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2018-12-03 06:51:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 904. [2018-12-03 06:51:41,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2018-12-03 06:51:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1062 transitions. [2018-12-03 06:51:41,367 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1062 transitions. Word has length 21 [2018-12-03 06:51:41,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,367 INFO L480 AbstractCegarLoop]: Abstraction has 904 states and 1062 transitions. [2018-12-03 06:51:41,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,367 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1062 transitions. [2018-12-03 06:51:41,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 06:51:41,369 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:51:41,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:51:41,369 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:51:41,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:51:41,369 INFO L82 PathProgramCache]: Analyzing trace with hash 567060669, now seen corresponding path program 1 times [2018-12-03 06:51:41,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:51:41,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:51:41,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:51:41,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:51:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:51:41,383 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-03 06:51:41,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:51:41,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:51:41,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:51:41,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:51:41,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:51:41,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:51:41,384 INFO L87 Difference]: Start difference. First operand 904 states and 1062 transitions. Second operand 3 states. [2018-12-03 06:51:41,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:51:41,412 INFO L93 Difference]: Finished difference Result 1992 states and 2278 transitions. [2018-12-03 06:51:41,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:51:41,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-12-03 06:51:41,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:51:41,412 INFO L225 Difference]: With dead ends: 1992 [2018-12-03 06:51:41,412 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 06:51:41,414 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-03 06:51:41,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 06:51:41,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 06:51:41,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 06:51:41,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 06:51:41,414 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-12-03 06:51:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:51:41,415 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 06:51:41,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:51:41,415 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 06:51:41,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 06:51:41,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 06:51:41,434 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 06:51:41,434 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 06:51:41,434 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 06:51:41,434 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 06:51:41,434 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 06:51:41,434 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 06:51:41,434 INFO L448 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-12-03 06:51:41,434 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L451 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-12-03 06:51:41,435 INFO L448 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L451 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L444 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-12-03 06:51:41,436 INFO L448 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,437 INFO L448 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-12-03 06:51:41,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:51:41 BoogieIcfgContainer [2018-12-03 06:51:41,442 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:51:41,443 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:51:41,443 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:51:41,443 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:51:41,443 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:51:40" (3/4) ... [2018-12-03 06:51:41,446 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 06:51:41,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 06:51:41,452 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 06:51:41,456 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-03 06:51:41,456 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-03 06:51:41,456 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 06:51:41,490 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_689dac78-f711-4882-8ca1-2ecc3de6df3b/bin-2019/utaipan/witness.graphml [2018-12-03 06:51:41,491 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:51:41,491 INFO L168 Benchmark]: Toolchain (without parser) took 1370.72 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Free memory was 958.8 MB in the beginning and 832.7 MB in the end (delta: 126.1 MB). Peak memory consumption was 190.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:51:41,492 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:51:41,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 123.80 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 06:51:41,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.84 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:51:41,492 INFO L168 Benchmark]: Boogie Preprocessor took 43.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-03 06:51:41,493 INFO L168 Benchmark]: RCFGBuilder took 159.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2018-12-03 06:51:41,493 INFO L168 Benchmark]: TraceAbstraction took 981.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 832.7 MB in the end (delta: 210.1 MB). Peak memory consumption was 210.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:51:41,493 INFO L168 Benchmark]: Witness Printer took 48.09 ms. Allocated memory is still 1.1 GB. Free memory is still 832.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:51:41,494 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 123.80 ms. Allocated memory is still 1.0 GB. Free memory was 958.8 MB in the beginning and 948.1 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.84 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 64.5 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 159.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 981.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 832.7 MB in the end (delta: 210.1 MB). Peak memory consumption was 210.1 MB. Max. memory is 11.5 GB. * Witness Printer took 48.09 ms. Allocated memory is still 1.1 GB. Free memory is still 832.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. SAFE Result, 0.9s OverallTime, 17 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 923 SDtfs, 417 SDslu, 612 SDs, 0 SdLazy, 91 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=904occurred in iteration=16, 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.1s AutomataMinimizationTime, 17 MinimizatonAttempts, 270 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 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, 317 NumberOfCodeBlocks, 317 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 9690 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...