./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/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 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 09:17:01,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 09:17:01,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 09:17:01,602 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 09:17:01,602 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 09:17:01,603 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 09:17:01,604 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 09:17:01,605 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 09:17:01,606 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 09:17:01,607 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 09:17:01,608 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 09:17:01,608 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 09:17:01,608 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 09:17:01,609 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 09:17:01,610 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 09:17:01,611 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 09:17:01,611 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 09:17:01,612 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 09:17:01,614 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 09:17:01,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 09:17:01,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 09:17:01,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 09:17:01,618 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 09:17:01,618 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 09:17:01,619 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 09:17:01,619 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 09:17:01,620 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 09:17:01,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 09:17:01,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 09:17:01,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 09:17:01,622 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 09:17:01,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 09:17:01,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 09:17:01,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 09:17:01,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 09:17:01,625 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 09:17:01,625 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 09:17:01,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 09:17:01,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 09:17:01,636 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 09:17:01,636 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 09:17:01,637 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 09:17:01,637 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 09:17:01,637 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 09:17:01,637 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 09:17:01,637 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 09:17:01,637 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 09:17:01,637 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 09:17:01,638 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 09:17:01,638 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 09:17:01,638 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 09:17:01,638 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 09:17:01,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 09:17:01,639 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 09:17:01,639 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 09:17:01,639 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 09:17:01,639 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 09:17:01,639 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 09:17:01,639 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 09:17:01,639 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 09:17:01,640 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 09:17:01,640 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 09:17:01,640 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 09:17:01,640 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 09:17:01,640 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 09:17:01,640 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 09:17:01,640 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 09:17:01,641 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 09:17:01,641 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 09:17:01,641 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 09:17:01,641 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 09:17:01,641 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_c662c8ca-730a-4a4e-b7b0-64ad10a11112/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 -> 16b9ec98922e529d9b7488fe4b8a5dfd7426fa85 [2018-11-10 09:17:01,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 09:17:01,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 09:17:01,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 09:17:01,679 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 09:17:01,679 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 09:17:01,679 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 09:17:01,722 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/data/8a9721917/af60f4fb1bce418ca70de2f5d6d1adbd/FLAG3c9cab551 [2018-11-10 09:17:02,121 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 09:17:02,121 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/sv-benchmarks/c/locks/test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 09:17:02,126 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/data/8a9721917/af60f4fb1bce418ca70de2f5d6d1adbd/FLAG3c9cab551 [2018-11-10 09:17:02,136 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/data/8a9721917/af60f4fb1bce418ca70de2f5d6d1adbd [2018-11-10 09:17:02,139 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 09:17:02,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 09:17:02,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 09:17:02,141 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 09:17:02,143 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 09:17:02,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d2276f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02, skipping insertion in model container [2018-11-10 09:17:02,146 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,152 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 09:17:02,167 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 09:17:02,280 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:17:02,282 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 09:17:02,302 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 09:17:02,313 INFO L193 MainTranslator]: Completed translation [2018-11-10 09:17:02,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02 WrapperNode [2018-11-10 09:17:02,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 09:17:02,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 09:17:02,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 09:17:02,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 09:17:02,319 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,323 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,326 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 09:17:02,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 09:17:02,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 09:17:02,327 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 09:17:02,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,333 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,336 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... [2018-11-10 09:17:02,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 09:17:02,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 09:17:02,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 09:17:02,343 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 09:17:02,343 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/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-11-10 09:17:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 09:17:02,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 09:17:02,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 09:17:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 09:17:02,430 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 09:17:02,430 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 09:17:02,645 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 09:17:02,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:17:02 BoogieIcfgContainer [2018-11-10 09:17:02,645 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 09:17:02,646 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 09:17:02,646 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 09:17:02,649 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 09:17:02,649 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 09:17:02" (1/3) ... [2018-11-10 09:17:02,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a0d782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:17:02, skipping insertion in model container [2018-11-10 09:17:02,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 09:17:02" (2/3) ... [2018-11-10 09:17:02,650 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15a0d782 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 09:17:02, skipping insertion in model container [2018-11-10 09:17:02,650 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:17:02" (3/3) ... [2018-11-10 09:17:02,652 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_12_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-10 09:17:02,660 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 09:17:02,667 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 09:17:02,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 09:17:02,713 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 09:17:02,713 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 09:17:02,713 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 09:17:02,713 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 09:17:02,713 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 09:17:02,713 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 09:17:02,714 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 09:17:02,714 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 09:17:02,729 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states. [2018-11-10 09:17:02,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 09:17:02,734 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:02,734 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:02,736 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:02,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 322166107, now seen corresponding path program 1 times [2018-11-10 09:17:02,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:02,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:02,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:02,783 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:02,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:02,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:02,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:02,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:02,890 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:02,894 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:02,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:02,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:02,904 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 3 states. [2018-11-10 09:17:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:02,945 INFO L93 Difference]: Finished difference Result 101 states and 176 transitions. [2018-11-10 09:17:02,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:02,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 09:17:02,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:02,955 INFO L225 Difference]: With dead ends: 101 [2018-11-10 09:17:02,955 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 09:17:02,957 INFO L605 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-11-10 09:17:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 09:17:02,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 59. [2018-11-10 09:17:02,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-10 09:17:02,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2018-11-10 09:17:02,985 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 23 [2018-11-10 09:17:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:02,986 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2018-11-10 09:17:02,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2018-11-10 09:17:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-10 09:17:02,987 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:02,987 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:02,987 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:02,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash -957697571, now seen corresponding path program 1 times [2018-11-10 09:17:02,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:02,990 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:02,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:02,990 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,044 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,046 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand 3 states. [2018-11-10 09:17:03,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,073 INFO L93 Difference]: Finished difference Result 140 states and 255 transitions. [2018-11-10 09:17:03,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-10 09:17:03,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,075 INFO L225 Difference]: With dead ends: 140 [2018-11-10 09:17:03,075 INFO L226 Difference]: Without dead ends: 86 [2018-11-10 09:17:03,076 INFO L605 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-11-10 09:17:03,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-11-10 09:17:03,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2018-11-10 09:17:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-10 09:17:03,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 151 transitions. [2018-11-10 09:17:03,084 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 151 transitions. Word has length 23 [2018-11-10 09:17:03,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,084 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 151 transitions. [2018-11-10 09:17:03,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 151 transitions. [2018-11-10 09:17:03,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:17:03,085 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,085 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,085 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1397427458, now seen corresponding path program 1 times [2018-11-10 09:17:03,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,086 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,134 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,135 INFO L87 Difference]: Start difference. First operand 84 states and 151 transitions. Second operand 3 states. [2018-11-10 09:17:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,146 INFO L93 Difference]: Finished difference Result 130 states and 229 transitions. [2018-11-10 09:17:03,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 09:17:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,148 INFO L225 Difference]: With dead ends: 130 [2018-11-10 09:17:03,148 INFO L226 Difference]: Without dead ends: 90 [2018-11-10 09:17:03,148 INFO L605 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-11-10 09:17:03,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-10 09:17:03,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 88. [2018-11-10 09:17:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-11-10 09:17:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 154 transitions. [2018-11-10 09:17:03,153 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 154 transitions. Word has length 24 [2018-11-10 09:17:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,153 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 154 transitions. [2018-11-10 09:17:03,153 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 154 transitions. [2018-11-10 09:17:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:17:03,154 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,154 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,154 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,154 INFO L82 PathProgramCache]: Analyzing trace with hash 376359104, now seen corresponding path program 1 times [2018-11-10 09:17:03,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,155 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,185 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,186 INFO L87 Difference]: Start difference. First operand 88 states and 154 transitions. Second operand 3 states. [2018-11-10 09:17:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,221 INFO L93 Difference]: Finished difference Result 165 states and 293 transitions. [2018-11-10 09:17:03,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 09:17:03,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,223 INFO L225 Difference]: With dead ends: 165 [2018-11-10 09:17:03,224 INFO L226 Difference]: Without dead ends: 163 [2018-11-10 09:17:03,224 INFO L605 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-11-10 09:17:03,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-10 09:17:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2018-11-10 09:17:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-10 09:17:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 203 transitions. [2018-11-10 09:17:03,232 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 203 transitions. Word has length 24 [2018-11-10 09:17:03,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,233 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 203 transitions. [2018-11-10 09:17:03,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,233 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 203 transitions. [2018-11-10 09:17:03,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-10 09:17:03,234 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,234 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,234 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,235 INFO L82 PathProgramCache]: Analyzing trace with hash -903504574, now seen corresponding path program 1 times [2018-11-10 09:17:03,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,236 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,262 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,262 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,263 INFO L87 Difference]: Start difference. First operand 115 states and 203 transitions. Second operand 3 states. [2018-11-10 09:17:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,282 INFO L93 Difference]: Finished difference Result 271 states and 485 transitions. [2018-11-10 09:17:03,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-11-10 09:17:03,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,283 INFO L225 Difference]: With dead ends: 271 [2018-11-10 09:17:03,283 INFO L226 Difference]: Without dead ends: 165 [2018-11-10 09:17:03,284 INFO L605 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-11-10 09:17:03,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-10 09:17:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2018-11-10 09:17:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-11-10 09:17:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 287 transitions. [2018-11-10 09:17:03,293 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 287 transitions. Word has length 24 [2018-11-10 09:17:03,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,293 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 287 transitions. [2018-11-10 09:17:03,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,293 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 287 transitions. [2018-11-10 09:17:03,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:17:03,294 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,294 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,294 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1217556590, now seen corresponding path program 1 times [2018-11-10 09:17:03,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,296 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,331 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,332 INFO L87 Difference]: Start difference. First operand 163 states and 287 transitions. Second operand 3 states. [2018-11-10 09:17:03,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,352 INFO L93 Difference]: Finished difference Result 244 states and 428 transitions. [2018-11-10 09:17:03,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 09:17:03,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,354 INFO L225 Difference]: With dead ends: 244 [2018-11-10 09:17:03,354 INFO L226 Difference]: Without dead ends: 167 [2018-11-10 09:17:03,355 INFO L605 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-11-10 09:17:03,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-10 09:17:03,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-11-10 09:17:03,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-11-10 09:17:03,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 287 transitions. [2018-11-10 09:17:03,363 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 287 transitions. Word has length 25 [2018-11-10 09:17:03,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,363 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 287 transitions. [2018-11-10 09:17:03,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,363 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 287 transitions. [2018-11-10 09:17:03,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:17:03,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,364 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,364 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,366 INFO L82 PathProgramCache]: Analyzing trace with hash 2056342352, now seen corresponding path program 1 times [2018-11-10 09:17:03,366 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,367 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,394 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,394 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,395 INFO L87 Difference]: Start difference. First operand 165 states and 287 transitions. Second operand 3 states. [2018-11-10 09:17:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,419 INFO L93 Difference]: Finished difference Result 309 states and 545 transitions. [2018-11-10 09:17:03,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 09:17:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,422 INFO L225 Difference]: With dead ends: 309 [2018-11-10 09:17:03,422 INFO L226 Difference]: Without dead ends: 307 [2018-11-10 09:17:03,422 INFO L605 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-11-10 09:17:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-11-10 09:17:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 221. [2018-11-10 09:17:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-11-10 09:17:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 383 transitions. [2018-11-10 09:17:03,434 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 383 transitions. Word has length 25 [2018-11-10 09:17:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,434 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 383 transitions. [2018-11-10 09:17:03,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 383 transitions. [2018-11-10 09:17:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-10 09:17:03,436 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,437 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,437 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,437 INFO L82 PathProgramCache]: Analyzing trace with hash 776478674, now seen corresponding path program 1 times [2018-11-10 09:17:03,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,438 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,459 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,460 INFO L87 Difference]: Start difference. First operand 221 states and 383 transitions. Second operand 3 states. [2018-11-10 09:17:03,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,488 INFO L93 Difference]: Finished difference Result 525 states and 917 transitions. [2018-11-10 09:17:03,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,489 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-11-10 09:17:03,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,491 INFO L225 Difference]: With dead ends: 525 [2018-11-10 09:17:03,491 INFO L226 Difference]: Without dead ends: 315 [2018-11-10 09:17:03,491 INFO L605 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-11-10 09:17:03,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-11-10 09:17:03,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-11-10 09:17:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-11-10 09:17:03,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 539 transitions. [2018-11-10 09:17:03,502 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 539 transitions. Word has length 25 [2018-11-10 09:17:03,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,503 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 539 transitions. [2018-11-10 09:17:03,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,503 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 539 transitions. [2018-11-10 09:17:03,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 09:17:03,504 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,504 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,506 INFO L82 PathProgramCache]: Analyzing trace with hash -677683113, now seen corresponding path program 1 times [2018-11-10 09:17:03,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,507 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,531 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,532 INFO L87 Difference]: Start difference. First operand 313 states and 539 transitions. Second operand 3 states. [2018-11-10 09:17:03,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,557 INFO L93 Difference]: Finished difference Result 469 states and 805 transitions. [2018-11-10 09:17:03,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 09:17:03,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,559 INFO L225 Difference]: With dead ends: 469 [2018-11-10 09:17:03,559 INFO L226 Difference]: Without dead ends: 319 [2018-11-10 09:17:03,559 INFO L605 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-11-10 09:17:03,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-11-10 09:17:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-11-10 09:17:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-11-10 09:17:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 539 transitions. [2018-11-10 09:17:03,568 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 539 transitions. Word has length 26 [2018-11-10 09:17:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,568 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 539 transitions. [2018-11-10 09:17:03,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,568 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 539 transitions. [2018-11-10 09:17:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 09:17:03,569 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,569 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,569 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1698751467, now seen corresponding path program 1 times [2018-11-10 09:17:03,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,571 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,606 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,606 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,607 INFO L87 Difference]: Start difference. First operand 317 states and 539 transitions. Second operand 3 states. [2018-11-10 09:17:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,642 INFO L93 Difference]: Finished difference Result 589 states and 1017 transitions. [2018-11-10 09:17:03,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,642 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 09:17:03,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,645 INFO L225 Difference]: With dead ends: 589 [2018-11-10 09:17:03,645 INFO L226 Difference]: Without dead ends: 587 [2018-11-10 09:17:03,645 INFO L605 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-11-10 09:17:03,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2018-11-10 09:17:03,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 433. [2018-11-10 09:17:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-11-10 09:17:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 727 transitions. [2018-11-10 09:17:03,659 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 727 transitions. Word has length 26 [2018-11-10 09:17:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,660 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 727 transitions. [2018-11-10 09:17:03,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,660 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 727 transitions. [2018-11-10 09:17:03,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 09:17:03,661 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,661 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,661 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1316352151, now seen corresponding path program 1 times [2018-11-10 09:17:03,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,663 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,694 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,695 INFO L87 Difference]: Start difference. First operand 433 states and 727 transitions. Second operand 3 states. [2018-11-10 09:17:03,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,726 INFO L93 Difference]: Finished difference Result 1029 states and 1737 transitions. [2018-11-10 09:17:03,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-11-10 09:17:03,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,728 INFO L225 Difference]: With dead ends: 1029 [2018-11-10 09:17:03,729 INFO L226 Difference]: Without dead ends: 611 [2018-11-10 09:17:03,730 INFO L605 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-11-10 09:17:03,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2018-11-10 09:17:03,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 609. [2018-11-10 09:17:03,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-10 09:17:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 1015 transitions. [2018-11-10 09:17:03,748 INFO L78 Accepts]: Start accepts. Automaton has 609 states and 1015 transitions. Word has length 26 [2018-11-10 09:17:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,748 INFO L481 AbstractCegarLoop]: Abstraction has 609 states and 1015 transitions. [2018-11-10 09:17:03,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,748 INFO L276 IsEmpty]: Start isEmpty. Operand 609 states and 1015 transitions. [2018-11-10 09:17:03,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 09:17:03,749 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,750 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,750 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1121474169, now seen corresponding path program 1 times [2018-11-10 09:17:03,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,751 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,770 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,770 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,771 INFO L87 Difference]: Start difference. First operand 609 states and 1015 transitions. Second operand 3 states. [2018-11-10 09:17:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,799 INFO L93 Difference]: Finished difference Result 913 states and 1517 transitions. [2018-11-10 09:17:03,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 09:17:03,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,802 INFO L225 Difference]: With dead ends: 913 [2018-11-10 09:17:03,802 INFO L226 Difference]: Without dead ends: 619 [2018-11-10 09:17:03,803 INFO L605 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-11-10 09:17:03,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-10 09:17:03,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-10 09:17:03,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-10 09:17:03,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 1015 transitions. [2018-11-10 09:17:03,820 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 1015 transitions. Word has length 27 [2018-11-10 09:17:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,821 INFO L481 AbstractCegarLoop]: Abstraction has 617 states and 1015 transitions. [2018-11-10 09:17:03,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,821 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 1015 transitions. [2018-11-10 09:17:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 09:17:03,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,822 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,822 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,822 INFO L82 PathProgramCache]: Analyzing trace with hash -2142542523, now seen corresponding path program 1 times [2018-11-10 09:17:03,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,824 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,844 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,844 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,844 INFO L87 Difference]: Start difference. First operand 617 states and 1015 transitions. Second operand 3 states. [2018-11-10 09:17:03,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,885 INFO L93 Difference]: Finished difference Result 1789 states and 2937 transitions. [2018-11-10 09:17:03,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 09:17:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,889 INFO L225 Difference]: With dead ends: 1789 [2018-11-10 09:17:03,889 INFO L226 Difference]: Without dead ends: 1195 [2018-11-10 09:17:03,891 INFO L605 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-11-10 09:17:03,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2018-11-10 09:17:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1193. [2018-11-10 09:17:03,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-10 09:17:03,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1927 transitions. [2018-11-10 09:17:03,925 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1927 transitions. Word has length 27 [2018-11-10 09:17:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:03,926 INFO L481 AbstractCegarLoop]: Abstraction has 1193 states and 1927 transitions. [2018-11-10 09:17:03,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1927 transitions. [2018-11-10 09:17:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 09:17:03,927 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:03,927 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:03,927 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:03,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:03,928 INFO L82 PathProgramCache]: Analyzing trace with hash -862678845, now seen corresponding path program 1 times [2018-11-10 09:17:03,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:03,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:03,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:03,929 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:03,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:03,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:03,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:03,956 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:03,956 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:03,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:03,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:03,957 INFO L87 Difference]: Start difference. First operand 1193 states and 1927 transitions. Second operand 3 states. [2018-11-10 09:17:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:03,985 INFO L93 Difference]: Finished difference Result 1469 states and 2425 transitions. [2018-11-10 09:17:03,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:03,986 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-10 09:17:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:03,990 INFO L225 Difference]: With dead ends: 1469 [2018-11-10 09:17:03,990 INFO L226 Difference]: Without dead ends: 1467 [2018-11-10 09:17:03,991 INFO L605 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-11-10 09:17:03,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2018-11-10 09:17:04,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1193. [2018-11-10 09:17:04,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1193 states. [2018-11-10 09:17:04,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1911 transitions. [2018-11-10 09:17:04,026 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1911 transitions. Word has length 27 [2018-11-10 09:17:04,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:04,027 INFO L481 AbstractCegarLoop]: Abstraction has 1193 states and 1911 transitions. [2018-11-10 09:17:04,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1911 transitions. [2018-11-10 09:17:04,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 09:17:04,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:04,028 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:04,029 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:04,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:04,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1994094676, now seen corresponding path program 1 times [2018-11-10 09:17:04,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:04,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,030 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:04,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:04,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:04,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:04,054 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:04,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:04,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:04,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:04,055 INFO L87 Difference]: Start difference. First operand 1193 states and 1911 transitions. Second operand 3 states. [2018-11-10 09:17:04,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:04,091 INFO L93 Difference]: Finished difference Result 2173 states and 3545 transitions. [2018-11-10 09:17:04,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:04,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 09:17:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:04,098 INFO L225 Difference]: With dead ends: 2173 [2018-11-10 09:17:04,098 INFO L226 Difference]: Without dead ends: 2171 [2018-11-10 09:17:04,099 INFO L605 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-11-10 09:17:04,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2018-11-10 09:17:04,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1689. [2018-11-10 09:17:04,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1689 states. [2018-11-10 09:17:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1689 states to 1689 states and 2647 transitions. [2018-11-10 09:17:04,148 INFO L78 Accepts]: Start accepts. Automaton has 1689 states and 2647 transitions. Word has length 28 [2018-11-10 09:17:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:04,148 INFO L481 AbstractCegarLoop]: Abstraction has 1689 states and 2647 transitions. [2018-11-10 09:17:04,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 1689 states and 2647 transitions. [2018-11-10 09:17:04,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-10 09:17:04,151 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:04,151 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:04,151 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:04,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:04,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1021008942, now seen corresponding path program 1 times [2018-11-10 09:17:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:04,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,153 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:04,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:04,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:04,175 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:04,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:04,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:04,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:04,176 INFO L87 Difference]: Start difference. First operand 1689 states and 2647 transitions. Second operand 3 states. [2018-11-10 09:17:04,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:04,271 INFO L93 Difference]: Finished difference Result 3997 states and 6297 transitions. [2018-11-10 09:17:04,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:04,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-11-10 09:17:04,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:04,279 INFO L225 Difference]: With dead ends: 3997 [2018-11-10 09:17:04,279 INFO L226 Difference]: Without dead ends: 2331 [2018-11-10 09:17:04,282 INFO L605 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-11-10 09:17:04,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2331 states. [2018-11-10 09:17:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2331 to 2329. [2018-11-10 09:17:04,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2329 states. [2018-11-10 09:17:04,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2329 states to 2329 states and 3623 transitions. [2018-11-10 09:17:04,345 INFO L78 Accepts]: Start accepts. Automaton has 2329 states and 3623 transitions. Word has length 28 [2018-11-10 09:17:04,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:04,345 INFO L481 AbstractCegarLoop]: Abstraction has 2329 states and 3623 transitions. [2018-11-10 09:17:04,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:04,345 INFO L276 IsEmpty]: Start isEmpty. Operand 2329 states and 3623 transitions. [2018-11-10 09:17:04,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:17:04,347 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:04,347 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:04,347 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:04,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:04,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1687178374, now seen corresponding path program 1 times [2018-11-10 09:17:04,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:04,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,352 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:04,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:04,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:04,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:04,417 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:04,417 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:04,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:04,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:04,417 INFO L87 Difference]: Start difference. First operand 2329 states and 3623 transitions. Second operand 3 states. [2018-11-10 09:17:04,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:04,483 INFO L93 Difference]: Finished difference Result 3517 states and 5465 transitions. [2018-11-10 09:17:04,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:04,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 09:17:04,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:04,490 INFO L225 Difference]: With dead ends: 3517 [2018-11-10 09:17:04,490 INFO L226 Difference]: Without dead ends: 2379 [2018-11-10 09:17:04,493 INFO L605 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-11-10 09:17:04,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2379 states. [2018-11-10 09:17:04,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2379 to 2377. [2018-11-10 09:17:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2018-11-10 09:17:04,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 3655 transitions. [2018-11-10 09:17:04,552 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 3655 transitions. Word has length 29 [2018-11-10 09:17:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:04,553 INFO L481 AbstractCegarLoop]: Abstraction has 2377 states and 3655 transitions. [2018-11-10 09:17:04,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:04,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 3655 transitions. [2018-11-10 09:17:04,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:17:04,555 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:04,555 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:04,555 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:04,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:04,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1586720568, now seen corresponding path program 1 times [2018-11-10 09:17:04,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:04,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:04,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,556 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:04,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:04,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:04,590 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:04,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:04,590 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:04,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:04,591 INFO L87 Difference]: Start difference. First operand 2377 states and 3655 transitions. Second operand 3 states. [2018-11-10 09:17:04,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:04,657 INFO L93 Difference]: Finished difference Result 4237 states and 6633 transitions. [2018-11-10 09:17:04,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:04,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 09:17:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:04,669 INFO L225 Difference]: With dead ends: 4237 [2018-11-10 09:17:04,670 INFO L226 Difference]: Without dead ends: 4235 [2018-11-10 09:17:04,671 INFO L605 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-11-10 09:17:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-11-10 09:17:04,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 3401. [2018-11-10 09:17:04,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3401 states. [2018-11-10 09:17:04,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3401 states to 3401 states and 5095 transitions. [2018-11-10 09:17:04,748 INFO L78 Accepts]: Start accepts. Automaton has 3401 states and 5095 transitions. Word has length 29 [2018-11-10 09:17:04,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:04,748 INFO L481 AbstractCegarLoop]: Abstraction has 3401 states and 5095 transitions. [2018-11-10 09:17:04,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:04,749 INFO L276 IsEmpty]: Start isEmpty. Operand 3401 states and 5095 transitions. [2018-11-10 09:17:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 09:17:04,752 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:04,752 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:04,752 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:04,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash 306856890, now seen corresponding path program 1 times [2018-11-10 09:17:04,753 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:04,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:04,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:04,754 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:04,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:04,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:04,781 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:04,781 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:04,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:04,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:04,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:04,782 INFO L87 Difference]: Start difference. First operand 3401 states and 5095 transitions. Second operand 3 states. [2018-11-10 09:17:04,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:04,880 INFO L93 Difference]: Finished difference Result 7949 states and 11945 transitions. [2018-11-10 09:17:04,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:04,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-11-10 09:17:04,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:04,893 INFO L225 Difference]: With dead ends: 7949 [2018-11-10 09:17:04,893 INFO L226 Difference]: Without dead ends: 4619 [2018-11-10 09:17:04,898 INFO L605 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-11-10 09:17:04,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4619 states. [2018-11-10 09:17:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4619 to 4617. [2018-11-10 09:17:05,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4617 states. [2018-11-10 09:17:05,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4617 states to 4617 states and 6855 transitions. [2018-11-10 09:17:05,015 INFO L78 Accepts]: Start accepts. Automaton has 4617 states and 6855 transitions. Word has length 29 [2018-11-10 09:17:05,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:05,015 INFO L481 AbstractCegarLoop]: Abstraction has 4617 states and 6855 transitions. [2018-11-10 09:17:05,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:05,015 INFO L276 IsEmpty]: Start isEmpty. Operand 4617 states and 6855 transitions. [2018-11-10 09:17:05,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 09:17:05,019 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:05,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:05,019 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:05,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:05,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1943912131, now seen corresponding path program 1 times [2018-11-10 09:17:05,020 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:05,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:05,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,021 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:05,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:05,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:05,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:05,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:05,054 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:05,054 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:05,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:05,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:05,054 INFO L87 Difference]: Start difference. First operand 4617 states and 6855 transitions. Second operand 3 states. [2018-11-10 09:17:05,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:05,132 INFO L93 Difference]: Finished difference Result 6925 states and 10249 transitions. [2018-11-10 09:17:05,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:05,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 09:17:05,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:05,146 INFO L225 Difference]: With dead ends: 6925 [2018-11-10 09:17:05,146 INFO L226 Difference]: Without dead ends: 4683 [2018-11-10 09:17:05,150 INFO L605 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-11-10 09:17:05,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2018-11-10 09:17:05,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4681. [2018-11-10 09:17:05,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4681 states. [2018-11-10 09:17:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4681 states to 4681 states and 6855 transitions. [2018-11-10 09:17:05,249 INFO L78 Accepts]: Start accepts. Automaton has 4681 states and 6855 transitions. Word has length 30 [2018-11-10 09:17:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:05,249 INFO L481 AbstractCegarLoop]: Abstraction has 4681 states and 6855 transitions. [2018-11-10 09:17:05,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4681 states and 6855 transitions. [2018-11-10 09:17:05,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 09:17:05,252 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:05,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:05,253 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:05,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:05,253 INFO L82 PathProgramCache]: Analyzing trace with hash 922843777, now seen corresponding path program 1 times [2018-11-10 09:17:05,253 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:05,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:05,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,254 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:05,269 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:05,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:05,269 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:05,270 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:05,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:05,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:05,270 INFO L87 Difference]: Start difference. First operand 4681 states and 6855 transitions. Second operand 3 states. [2018-11-10 09:17:05,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:05,342 INFO L93 Difference]: Finished difference Result 8205 states and 12233 transitions. [2018-11-10 09:17:05,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:05,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 09:17:05,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:05,355 INFO L225 Difference]: With dead ends: 8205 [2018-11-10 09:17:05,356 INFO L226 Difference]: Without dead ends: 8203 [2018-11-10 09:17:05,358 INFO L605 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-11-10 09:17:05,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8203 states. [2018-11-10 09:17:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8203 to 6793. [2018-11-10 09:17:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6793 states. [2018-11-10 09:17:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6793 states to 6793 states and 9671 transitions. [2018-11-10 09:17:05,452 INFO L78 Accepts]: Start accepts. Automaton has 6793 states and 9671 transitions. Word has length 30 [2018-11-10 09:17:05,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:05,452 INFO L481 AbstractCegarLoop]: Abstraction has 6793 states and 9671 transitions. [2018-11-10 09:17:05,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:05,452 INFO L276 IsEmpty]: Start isEmpty. Operand 6793 states and 9671 transitions. [2018-11-10 09:17:05,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-10 09:17:05,457 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:05,457 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:05,457 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:05,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:05,458 INFO L82 PathProgramCache]: Analyzing trace with hash -357019901, now seen corresponding path program 1 times [2018-11-10 09:17:05,458 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:05,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:05,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,459 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:05,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:05,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:05,485 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:05,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:05,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:05,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:05,486 INFO L87 Difference]: Start difference. First operand 6793 states and 9671 transitions. Second operand 3 states. [2018-11-10 09:17:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:05,582 INFO L93 Difference]: Finished difference Result 15757 states and 22473 transitions. [2018-11-10 09:17:05,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:05,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-11-10 09:17:05,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:05,594 INFO L225 Difference]: With dead ends: 15757 [2018-11-10 09:17:05,594 INFO L226 Difference]: Without dead ends: 9099 [2018-11-10 09:17:05,602 INFO L605 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-11-10 09:17:05,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9099 states. [2018-11-10 09:17:05,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9099 to 9097. [2018-11-10 09:17:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9097 states. [2018-11-10 09:17:05,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9097 states to 9097 states and 12807 transitions. [2018-11-10 09:17:05,747 INFO L78 Accepts]: Start accepts. Automaton has 9097 states and 12807 transitions. Word has length 30 [2018-11-10 09:17:05,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:05,748 INFO L481 AbstractCegarLoop]: Abstraction has 9097 states and 12807 transitions. [2018-11-10 09:17:05,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:05,748 INFO L276 IsEmpty]: Start isEmpty. Operand 9097 states and 12807 transitions. [2018-11-10 09:17:05,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 09:17:05,754 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:05,754 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:05,754 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:05,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:05,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1456398865, now seen corresponding path program 1 times [2018-11-10 09:17:05,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:05,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:05,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:05,756 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:05,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:05,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:05,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:05,782 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:05,782 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:05,783 INFO L87 Difference]: Start difference. First operand 9097 states and 12807 transitions. Second operand 3 states. [2018-11-10 09:17:05,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:05,919 INFO L93 Difference]: Finished difference Result 13645 states and 19145 transitions. [2018-11-10 09:17:05,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:05,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 09:17:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:05,935 INFO L225 Difference]: With dead ends: 13645 [2018-11-10 09:17:05,935 INFO L226 Difference]: Without dead ends: 9227 [2018-11-10 09:17:05,942 INFO L605 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-11-10 09:17:05,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9227 states. [2018-11-10 09:17:06,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9227 to 9225. [2018-11-10 09:17:06,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9225 states. [2018-11-10 09:17:06,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9225 states to 9225 states and 12807 transitions. [2018-11-10 09:17:06,161 INFO L78 Accepts]: Start accepts. Automaton has 9225 states and 12807 transitions. Word has length 31 [2018-11-10 09:17:06,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:06,162 INFO L481 AbstractCegarLoop]: Abstraction has 9225 states and 12807 transitions. [2018-11-10 09:17:06,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:06,162 INFO L276 IsEmpty]: Start isEmpty. Operand 9225 states and 12807 transitions. [2018-11-10 09:17:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 09:17:06,171 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:06,171 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:06,171 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:06,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1817500077, now seen corresponding path program 1 times [2018-11-10 09:17:06,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:06,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:06,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:06,174 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:06,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:06,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:06,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:06,206 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:06,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:06,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:06,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:06,206 INFO L87 Difference]: Start difference. First operand 9225 states and 12807 transitions. Second operand 3 states. [2018-11-10 09:17:06,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:06,409 INFO L93 Difference]: Finished difference Result 15885 states and 22409 transitions. [2018-11-10 09:17:06,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:06,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 09:17:06,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:06,436 INFO L225 Difference]: With dead ends: 15885 [2018-11-10 09:17:06,436 INFO L226 Difference]: Without dead ends: 15883 [2018-11-10 09:17:06,441 INFO L605 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-11-10 09:17:06,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15883 states. [2018-11-10 09:17:06,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15883 to 13577. [2018-11-10 09:17:06,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13577 states. [2018-11-10 09:17:06,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13577 states to 13577 states and 18311 transitions. [2018-11-10 09:17:06,723 INFO L78 Accepts]: Start accepts. Automaton has 13577 states and 18311 transitions. Word has length 31 [2018-11-10 09:17:06,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:06,723 INFO L481 AbstractCegarLoop]: Abstraction has 13577 states and 18311 transitions. [2018-11-10 09:17:06,724 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 13577 states and 18311 transitions. [2018-11-10 09:17:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-10 09:17:06,738 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:06,738 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:06,738 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:06,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:06,739 INFO L82 PathProgramCache]: Analyzing trace with hash 537636399, now seen corresponding path program 1 times [2018-11-10 09:17:06,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:06,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:06,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:06,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:06,740 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:06,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:06,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:06,764 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:06,764 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:06,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:06,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:06,764 INFO L87 Difference]: Start difference. First operand 13577 states and 18311 transitions. Second operand 3 states. [2018-11-10 09:17:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:06,976 INFO L93 Difference]: Finished difference Result 31245 states and 42121 transitions. [2018-11-10 09:17:06,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:06,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-10 09:17:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:07,002 INFO L225 Difference]: With dead ends: 31245 [2018-11-10 09:17:07,003 INFO L226 Difference]: Without dead ends: 17931 [2018-11-10 09:17:07,020 INFO L605 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-11-10 09:17:07,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17931 states. [2018-11-10 09:17:07,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17931 to 17929. [2018-11-10 09:17:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17929 states. [2018-11-10 09:17:07,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17929 states to 17929 states and 23815 transitions. [2018-11-10 09:17:07,304 INFO L78 Accepts]: Start accepts. Automaton has 17929 states and 23815 transitions. Word has length 31 [2018-11-10 09:17:07,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:07,304 INFO L481 AbstractCegarLoop]: Abstraction has 17929 states and 23815 transitions. [2018-11-10 09:17:07,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 17929 states and 23815 transitions. [2018-11-10 09:17:07,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 09:17:07,318 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:07,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:07,318 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:07,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash 508143000, now seen corresponding path program 1 times [2018-11-10 09:17:07,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:07,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:07,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:07,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:07,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:07,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:07,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:07,337 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:07,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:07,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:07,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:07,338 INFO L87 Difference]: Start difference. First operand 17929 states and 23815 transitions. Second operand 3 states. [2018-11-10 09:17:07,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:07,561 INFO L93 Difference]: Finished difference Result 26893 states and 35593 transitions. [2018-11-10 09:17:07,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:07,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 09:17:07,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:07,582 INFO L225 Difference]: With dead ends: 26893 [2018-11-10 09:17:07,582 INFO L226 Difference]: Without dead ends: 18187 [2018-11-10 09:17:07,592 INFO L605 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-11-10 09:17:07,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18187 states. [2018-11-10 09:17:07,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18187 to 18185. [2018-11-10 09:17:07,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18185 states. [2018-11-10 09:17:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18185 states to 18185 states and 23815 transitions. [2018-11-10 09:17:07,859 INFO L78 Accepts]: Start accepts. Automaton has 18185 states and 23815 transitions. Word has length 32 [2018-11-10 09:17:07,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:07,859 INFO L481 AbstractCegarLoop]: Abstraction has 18185 states and 23815 transitions. [2018-11-10 09:17:07,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:07,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18185 states and 23815 transitions. [2018-11-10 09:17:07,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 09:17:07,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:07,865 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:07,865 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:07,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:07,865 INFO L82 PathProgramCache]: Analyzing trace with hash -512925354, now seen corresponding path program 1 times [2018-11-10 09:17:07,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:07,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:07,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:07,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:07,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:07,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:07,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:07,887 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:07,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:07,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:07,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:07,888 INFO L87 Difference]: Start difference. First operand 18185 states and 23815 transitions. Second operand 3 states. [2018-11-10 09:17:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:08,124 INFO L93 Difference]: Finished difference Result 30733 states and 40713 transitions. [2018-11-10 09:17:08,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:08,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 09:17:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:08,155 INFO L225 Difference]: With dead ends: 30733 [2018-11-10 09:17:08,155 INFO L226 Difference]: Without dead ends: 30731 [2018-11-10 09:17:08,165 INFO L605 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-11-10 09:17:08,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30731 states. [2018-11-10 09:17:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30731 to 27145. [2018-11-10 09:17:08,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27145 states. [2018-11-10 09:17:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27145 states to 27145 states and 34567 transitions. [2018-11-10 09:17:08,684 INFO L78 Accepts]: Start accepts. Automaton has 27145 states and 34567 transitions. Word has length 32 [2018-11-10 09:17:08,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:08,685 INFO L481 AbstractCegarLoop]: Abstraction has 27145 states and 34567 transitions. [2018-11-10 09:17:08,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27145 states and 34567 transitions. [2018-11-10 09:17:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 09:17:08,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:08,702 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:08,702 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:08,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:08,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1792789032, now seen corresponding path program 1 times [2018-11-10 09:17:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:08,703 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:08,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:08,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:08,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:08,738 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:08,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:08,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:08,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:08,739 INFO L87 Difference]: Start difference. First operand 27145 states and 34567 transitions. Second operand 3 states. [2018-11-10 09:17:09,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:09,076 INFO L93 Difference]: Finished difference Result 61965 states and 78601 transitions. [2018-11-10 09:17:09,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:09,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-10 09:17:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:09,100 INFO L225 Difference]: With dead ends: 61965 [2018-11-10 09:17:09,100 INFO L226 Difference]: Without dead ends: 35339 [2018-11-10 09:17:09,133 INFO L605 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-11-10 09:17:09,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35339 states. [2018-11-10 09:17:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35339 to 35337. [2018-11-10 09:17:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35337 states. [2018-11-10 09:17:09,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35337 states to 35337 states and 44039 transitions. [2018-11-10 09:17:09,693 INFO L78 Accepts]: Start accepts. Automaton has 35337 states and 44039 transitions. Word has length 32 [2018-11-10 09:17:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:09,693 INFO L481 AbstractCegarLoop]: Abstraction has 35337 states and 44039 transitions. [2018-11-10 09:17:09,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35337 states and 44039 transitions. [2018-11-10 09:17:09,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 09:17:09,704 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:09,704 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:09,705 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:09,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:09,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1279399012, now seen corresponding path program 1 times [2018-11-10 09:17:09,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:09,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:09,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:09,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:09,705 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:09,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:09,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:09,729 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:09,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:09,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:09,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:09,730 INFO L87 Difference]: Start difference. First operand 35337 states and 44039 transitions. Second operand 3 states. [2018-11-10 09:17:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:10,061 INFO L93 Difference]: Finished difference Result 53005 states and 65801 transitions. [2018-11-10 09:17:10,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:10,061 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 09:17:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:10,090 INFO L225 Difference]: With dead ends: 53005 [2018-11-10 09:17:10,090 INFO L226 Difference]: Without dead ends: 35851 [2018-11-10 09:17:10,104 INFO L605 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-11-10 09:17:10,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35851 states. [2018-11-10 09:17:10,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35851 to 35849. [2018-11-10 09:17:10,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35849 states. [2018-11-10 09:17:10,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35849 states to 35849 states and 44039 transitions. [2018-11-10 09:17:10,642 INFO L78 Accepts]: Start accepts. Automaton has 35849 states and 44039 transitions. Word has length 33 [2018-11-10 09:17:10,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:10,643 INFO L481 AbstractCegarLoop]: Abstraction has 35849 states and 44039 transitions. [2018-11-10 09:17:10,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:10,643 INFO L276 IsEmpty]: Start isEmpty. Operand 35849 states and 44039 transitions. [2018-11-10 09:17:10,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 09:17:10,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:10,654 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:10,654 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:10,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:10,654 INFO L82 PathProgramCache]: Analyzing trace with hash 258330658, now seen corresponding path program 1 times [2018-11-10 09:17:10,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:10,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:10,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:10,655 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:10,677 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:10,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:10,677 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:10,677 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:10,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:10,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:10,677 INFO L87 Difference]: Start difference. First operand 35849 states and 44039 transitions. Second operand 3 states. [2018-11-10 09:17:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:11,175 INFO L93 Difference]: Finished difference Result 59405 states and 73225 transitions. [2018-11-10 09:17:11,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:11,176 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 09:17:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:11,219 INFO L225 Difference]: With dead ends: 59405 [2018-11-10 09:17:11,219 INFO L226 Difference]: Without dead ends: 59403 [2018-11-10 09:17:11,229 INFO L605 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-11-10 09:17:11,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59403 states. [2018-11-10 09:17:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59403 to 54281. [2018-11-10 09:17:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54281 states. [2018-11-10 09:17:11,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54281 states to 54281 states and 65031 transitions. [2018-11-10 09:17:11,968 INFO L78 Accepts]: Start accepts. Automaton has 54281 states and 65031 transitions. Word has length 33 [2018-11-10 09:17:11,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:11,969 INFO L481 AbstractCegarLoop]: Abstraction has 54281 states and 65031 transitions. [2018-11-10 09:17:11,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:11,969 INFO L276 IsEmpty]: Start isEmpty. Operand 54281 states and 65031 transitions. [2018-11-10 09:17:11,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-10 09:17:11,993 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:11,993 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:11,993 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:11,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:11,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1021533020, now seen corresponding path program 1 times [2018-11-10 09:17:11,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:11,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:11,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:11,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:11,995 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:12,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:12,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:12,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:12,034 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:12,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:12,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:12,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:12,034 INFO L87 Difference]: Start difference. First operand 54281 states and 65031 transitions. Second operand 3 states. [2018-11-10 09:17:12,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:12,682 INFO L93 Difference]: Finished difference Result 122893 states and 145929 transitions. [2018-11-10 09:17:12,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:12,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-11-10 09:17:12,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:12,739 INFO L225 Difference]: With dead ends: 122893 [2018-11-10 09:17:12,739 INFO L226 Difference]: Without dead ends: 69643 [2018-11-10 09:17:12,776 INFO L605 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-11-10 09:17:12,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69643 states. [2018-11-10 09:17:13,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69643 to 69641. [2018-11-10 09:17:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69641 states. [2018-11-10 09:17:13,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69641 states to 69641 states and 80903 transitions. [2018-11-10 09:17:13,906 INFO L78 Accepts]: Start accepts. Automaton has 69641 states and 80903 transitions. Word has length 33 [2018-11-10 09:17:13,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:13,907 INFO L481 AbstractCegarLoop]: Abstraction has 69641 states and 80903 transitions. [2018-11-10 09:17:13,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:13,907 INFO L276 IsEmpty]: Start isEmpty. Operand 69641 states and 80903 transitions. [2018-11-10 09:17:13,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 09:17:13,934 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:13,934 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:13,934 INFO L424 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:13,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:13,935 INFO L82 PathProgramCache]: Analyzing trace with hash -581468051, now seen corresponding path program 1 times [2018-11-10 09:17:13,935 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:13,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:13,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:13,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:13,935 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:13,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:13,955 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:13,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:13,955 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:13,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:13,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:13,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:13,955 INFO L87 Difference]: Start difference. First operand 69641 states and 80903 transitions. Second operand 3 states. [2018-11-10 09:17:14,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:14,791 INFO L93 Difference]: Finished difference Result 104461 states and 120841 transitions. [2018-11-10 09:17:14,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:14,791 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 09:17:14,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:14,842 INFO L225 Difference]: With dead ends: 104461 [2018-11-10 09:17:14,842 INFO L226 Difference]: Without dead ends: 70667 [2018-11-10 09:17:14,864 INFO L605 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-11-10 09:17:14,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70667 states. [2018-11-10 09:17:15,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70667 to 70665. [2018-11-10 09:17:15,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70665 states. [2018-11-10 09:17:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70665 states to 70665 states and 80903 transitions. [2018-11-10 09:17:15,812 INFO L78 Accepts]: Start accepts. Automaton has 70665 states and 80903 transitions. Word has length 34 [2018-11-10 09:17:15,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:15,812 INFO L481 AbstractCegarLoop]: Abstraction has 70665 states and 80903 transitions. [2018-11-10 09:17:15,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 70665 states and 80903 transitions. [2018-11-10 09:17:15,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 09:17:15,840 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:15,840 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:15,840 INFO L424 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:15,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:15,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1602536405, now seen corresponding path program 1 times [2018-11-10 09:17:15,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:15,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:15,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:15,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:15,841 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:15,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:15,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:15,869 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:15,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:15,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:15,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:15,870 INFO L87 Difference]: Start difference. First operand 70665 states and 80903 transitions. Second operand 3 states. [2018-11-10 09:17:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:16,990 INFO L93 Difference]: Finished difference Result 114699 states and 130056 transitions. [2018-11-10 09:17:16,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:16,990 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 09:17:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:17,077 INFO L225 Difference]: With dead ends: 114699 [2018-11-10 09:17:17,078 INFO L226 Difference]: Without dead ends: 114697 [2018-11-10 09:17:17,091 INFO L605 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-11-10 09:17:17,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114697 states. [2018-11-10 09:17:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114697 to 108553. [2018-11-10 09:17:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108553 states. [2018-11-10 09:17:18,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108553 states to 108553 states and 121863 transitions. [2018-11-10 09:17:18,303 INFO L78 Accepts]: Start accepts. Automaton has 108553 states and 121863 transitions. Word has length 34 [2018-11-10 09:17:18,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:18,304 INFO L481 AbstractCegarLoop]: Abstraction has 108553 states and 121863 transitions. [2018-11-10 09:17:18,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:18,304 INFO L276 IsEmpty]: Start isEmpty. Operand 108553 states and 121863 transitions. [2018-11-10 09:17:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 09:17:18,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 09:17:18,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 09:17:18,372 INFO L424 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 09:17:18,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 09:17:18,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1412567213, now seen corresponding path program 1 times [2018-11-10 09:17:18,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 09:17:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:18,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 09:17:18,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 09:17:18,373 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 09:17:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 09:17:18,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 09:17:18,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 09:17:18,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 09:17:18,406 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 09:17:18,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 09:17:18,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 09:17:18,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 09:17:18,407 INFO L87 Difference]: Start difference. First operand 108553 states and 121863 transitions. Second operand 3 states. [2018-11-10 09:17:19,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 09:17:19,972 INFO L93 Difference]: Finished difference Result 243721 states and 269319 transitions. [2018-11-10 09:17:19,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 09:17:19,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-11-10 09:17:19,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 09:17:19,973 INFO L225 Difference]: With dead ends: 243721 [2018-11-10 09:17:19,973 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 09:17:20,069 INFO L605 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-11-10 09:17:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 09:17:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 09:17:20,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 09:17:20,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 09:17:20,070 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2018-11-10 09:17:20,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 09:17:20,070 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 09:17:20,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 09:17:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 09:17:20,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 09:17:20,073 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 09:17:20,123 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 09:17:20,123 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:17:20,123 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 09:17:20,123 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 09:17:20,123 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 09:17:20,123 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 09:17:20,123 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 191) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L151-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L176-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L152(line 152) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L136-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L161-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L112-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 191) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L137(line 137) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L104-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,124 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 191) the Hoare annotation is: true [2018-11-10 09:17:20,125 INFO L428 ceAbstractionStarter]: At program point L187(lines 5 191) the Hoare annotation is: true [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L88-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L146-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L47(lines 47 49) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L80-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L131-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,125 INFO L428 ceAbstractionStarter]: At program point L181-1(lines 45 186) the Hoare annotation is: true [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 189) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L182(line 182) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L421 ceAbstractionStarter]: At program point L182-1(lines 5 191) the Hoare annotation is: false [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L116-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L166-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L100-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L76-2(lines 45 186) no Hoare annotation was computed. [2018-11-10 09:17:20,126 INFO L425 ceAbstractionStarter]: For program point L167(line 167) no Hoare annotation was computed. [2018-11-10 09:17:20,132 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 09:17:20 BoogieIcfgContainer [2018-11-10 09:17:20,132 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 09:17:20,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 09:17:20,133 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 09:17:20,133 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 09:17:20,134 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 09:17:02" (3/4) ... [2018-11-10 09:17:20,137 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 09:17:20,143 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 09:17:20,144 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 09:17:20,148 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 09:17:20,148 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-10 09:17:20,148 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 09:17:20,192 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c662c8ca-730a-4a4e-b7b0-64ad10a11112/bin-2019/utaipan/witness.graphml [2018-11-10 09:17:20,192 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 09:17:20,193 INFO L168 Benchmark]: Toolchain (without parser) took 18053.82 ms. Allocated memory was 1.0 GB in the beginning and 2.9 GB in the end (delta: 1.9 GB). Free memory was 960.8 MB in the beginning and 1.3 GB in the end (delta: -322.0 MB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2018-11-10 09:17:20,194 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:17:20,194 INFO L168 Benchmark]: CACSL2BoogieTranslator took 172.50 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 948.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. [2018-11-10 09:17:20,195 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.97 ms. Allocated memory is still 1.0 GB. Free memory was 948.8 MB in the beginning and 946.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 09:17:20,195 INFO L168 Benchmark]: Boogie Preprocessor took 15.79 ms. Allocated memory is still 1.0 GB. Free memory is still 946.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 09:17:20,195 INFO L168 Benchmark]: RCFGBuilder took 302.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2018-11-10 09:17:20,195 INFO L168 Benchmark]: TraceAbstraction took 17486.41 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -153.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-11-10 09:17:20,196 INFO L168 Benchmark]: Witness Printer took 60.03 ms. Allocated memory is still 2.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 871.2 kB). Peak memory consumption was 871.2 kB. Max. memory is 11.5 GB. [2018-11-10 09:17:20,201 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 172.50 ms. Allocated memory is still 1.0 GB. Free memory was 960.8 MB in the beginning and 948.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.97 ms. Allocated memory is still 1.0 GB. Free memory was 948.8 MB in the beginning and 946.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.79 ms. Allocated memory is still 1.0 GB. Free memory is still 946.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 302.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -184.0 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17486.41 ms. Allocated memory was 1.2 GB in the beginning and 2.9 GB in the end (delta: 1.7 GB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -153.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 60.03 ms. Allocated memory is still 2.9 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 871.2 kB). Peak memory consumption was 871.2 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 189]: 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: 1 - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 51 locations, 1 error locations. SAFE Result, 17.4s OverallTime, 34 OverallIterations, 1 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3487 SDtfs, 1713 SDslu, 2374 SDs, 0 SdLazy, 181 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=108553occurred in iteration=33, 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: 7.6s AutomataMinimizationTime, 34 MinimizatonAttempts, 20515 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 4106 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 975 NumberOfCodeBlocks, 975 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 941 ConstructedInterpolants, 0 QuantifiedInterpolants, 53057 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 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...