./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_11_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_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/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 56f043bec3037ec37b4a132611abd4a337934428 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-26 20:06:31,377 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-26 20:06:31,378 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-26 20:06:31,387 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-26 20:06:31,388 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-26 20:06:31,388 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-26 20:06:31,392 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-26 20:06:31,393 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-26 20:06:31,394 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-26 20:06:31,395 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-26 20:06:31,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-26 20:06:31,396 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-26 20:06:31,397 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-26 20:06:31,398 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-26 20:06:31,398 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-26 20:06:31,399 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-26 20:06:31,400 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-26 20:06:31,401 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-26 20:06:31,403 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-26 20:06:31,404 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-26 20:06:31,405 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-26 20:06:31,406 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-26 20:06:31,408 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-26 20:06:31,408 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-26 20:06:31,408 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-26 20:06:31,409 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-26 20:06:31,410 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-26 20:06:31,410 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-26 20:06:31,411 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-26 20:06:31,413 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-26 20:06:31,413 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-26 20:06:31,413 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-26 20:06:31,413 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-26 20:06:31,413 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-26 20:06:31,414 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-26 20:06:31,415 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-26 20:06:31,415 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-10-26 20:06:31,427 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-26 20:06:31,427 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-26 20:06:31,428 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-26 20:06:31,428 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-26 20:06:31,428 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-26 20:06:31,428 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-26 20:06:31,428 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-26 20:06:31,429 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-26 20:06:31,429 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-26 20:06:31,429 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-26 20:06:31,429 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-26 20:06:31,429 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-26 20:06:31,430 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-26 20:06:31,430 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-26 20:06:31,430 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-26 20:06:31,430 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-26 20:06:31,430 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-26 20:06:31,430 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-26 20:06:31,430 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-26 20:06:31,431 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-26 20:06:31,431 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-26 20:06:31,431 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-26 20:06:31,431 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-26 20:06:31,431 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-26 20:06:31,433 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-26 20:06:31,433 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-26 20:06:31,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-26 20:06:31,434 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-26 20:06:31,434 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-26 20:06:31,434 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-26 20:06:31,434 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-26 20:06:31,434 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-26 20:06:31,434 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-26 20:06:31,435 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-26 20:06:31,435 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_4757a8a3-c34d-47de-91a8-342c6af2ed06/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 -> 56f043bec3037ec37b4a132611abd4a337934428 [2018-10-26 20:06:31,461 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-26 20:06:31,474 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-26 20:06:31,477 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-26 20:06:31,478 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-26 20:06:31,478 INFO L276 PluginConnector]: CDTParser initialized [2018-10-26 20:06:31,479 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:06:31,531 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/data/73a319c22/3eb91c8604c644aa8b1889bb5fb31e37/FLAGacf6294c8 [2018-10-26 20:06:31,933 INFO L298 CDTParser]: Found 1 translation units. [2018-10-26 20:06:31,933 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/sv-benchmarks/c/locks/test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:06:31,939 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/data/73a319c22/3eb91c8604c644aa8b1889bb5fb31e37/FLAGacf6294c8 [2018-10-26 20:06:31,951 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/data/73a319c22/3eb91c8604c644aa8b1889bb5fb31e37 [2018-10-26 20:06:31,954 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-26 20:06:31,955 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-26 20:06:31,956 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-26 20:06:31,956 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-26 20:06:31,959 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-26 20:06:31,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:06:31" (1/1) ... [2018-10-26 20:06:31,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@267e2a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:31, skipping insertion in model container [2018-10-26 20:06:31,966 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.10 08:06:31" (1/1) ... [2018-10-26 20:06:31,974 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-26 20:06:31,995 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-26 20:06:32,138 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:06:32,141 INFO L189 MainTranslator]: Completed pre-run [2018-10-26 20:06:32,161 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-26 20:06:32,171 INFO L193 MainTranslator]: Completed translation [2018-10-26 20:06:32,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32 WrapperNode [2018-10-26 20:06:32,171 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-26 20:06:32,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-26 20:06:32,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-26 20:06:32,172 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-26 20:06:32,178 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,183 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,186 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-26 20:06:32,186 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-26 20:06:32,187 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-26 20:06:32,187 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-26 20:06:32,194 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,196 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,196 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,198 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... [2018-10-26 20:06:32,207 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-26 20:06:32,207 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-26 20:06:32,207 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-26 20:06:32,207 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-26 20:06:32,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/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-10-26 20:06:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-26 20:06:32,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-26 20:06:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-26 20:06:32,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-26 20:06:32,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-26 20:06:32,307 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-26 20:06:32,749 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-26 20:06:32,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:06:32 BoogieIcfgContainer [2018-10-26 20:06:32,749 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-26 20:06:32,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-26 20:06:32,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-26 20:06:32,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-26 20:06:32,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.10 08:06:31" (1/3) ... [2018-10-26 20:06:32,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df11c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:06:32, skipping insertion in model container [2018-10-26 20:06:32,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.10 08:06:32" (2/3) ... [2018-10-26 20:06:32,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1df11c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.10 08:06:32, skipping insertion in model container [2018-10-26 20:06:32,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:06:32" (3/3) ... [2018-10-26 20:06:32,755 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11_true-unreach-call_true-valid-memsafety_false-termination.c [2018-10-26 20:06:32,763 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-26 20:06:32,769 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-26 20:06:32,781 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-26 20:06:32,804 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-26 20:06:32,804 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-26 20:06:32,804 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-26 20:06:32,805 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-26 20:06:32,805 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-26 20:06:32,805 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-26 20:06:32,805 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-26 20:06:32,805 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-26 20:06:32,818 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states. [2018-10-26 20:06:32,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:06:32,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:32,824 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] [2018-10-26 20:06:32,826 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:32,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:32,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1514281487, now seen corresponding path program 1 times [2018-10-26 20:06:32,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:32,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:32,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:32,867 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:32,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:32,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:32,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:32,988 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:32,992 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:32,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:33,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:33,001 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 3 states. [2018-10-26 20:06:33,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:33,068 INFO L93 Difference]: Finished difference Result 95 states and 164 transitions. [2018-10-26 20:06:33,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:33,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:06:33,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:33,082 INFO L225 Difference]: With dead ends: 95 [2018-10-26 20:06:33,082 INFO L226 Difference]: Without dead ends: 80 [2018-10-26 20:06:33,084 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-10-26 20:06:33,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-26 20:06:33,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 55. [2018-10-26 20:06:33,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-26 20:06:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 98 transitions. [2018-10-26 20:06:33,122 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 98 transitions. Word has length 22 [2018-10-26 20:06:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:33,122 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 98 transitions. [2018-10-26 20:06:33,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:33,123 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 98 transitions. [2018-10-26 20:06:33,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-26 20:06:33,124 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:33,124 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] [2018-10-26 20:06:33,125 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:33,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:33,125 INFO L82 PathProgramCache]: Analyzing trace with hash 503164237, now seen corresponding path program 1 times [2018-10-26 20:06:33,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:33,126 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,126 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:33,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:33,210 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:33,210 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:33,210 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:33,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:33,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:33,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:33,212 INFO L87 Difference]: Start difference. First operand 55 states and 98 transitions. Second operand 3 states. [2018-10-26 20:06:33,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:33,283 INFO L93 Difference]: Finished difference Result 130 states and 235 transitions. [2018-10-26 20:06:33,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:33,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-10-26 20:06:33,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:33,285 INFO L225 Difference]: With dead ends: 130 [2018-10-26 20:06:33,285 INFO L226 Difference]: Without dead ends: 80 [2018-10-26 20:06:33,286 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-10-26 20:06:33,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-26 20:06:33,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2018-10-26 20:06:33,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-26 20:06:33,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 139 transitions. [2018-10-26 20:06:33,297 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 139 transitions. Word has length 22 [2018-10-26 20:06:33,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:33,297 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 139 transitions. [2018-10-26 20:06:33,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:33,298 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 139 transitions. [2018-10-26 20:06:33,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:06:33,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:33,298 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-10-26 20:06:33,299 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:33,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:33,300 INFO L82 PathProgramCache]: Analyzing trace with hash -301701102, now seen corresponding path program 1 times [2018-10-26 20:06:33,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:33,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:33,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,302 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:33,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:33,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:33,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:33,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:33,385 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:33,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:33,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:33,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:33,386 INFO L87 Difference]: Start difference. First operand 78 states and 139 transitions. Second operand 3 states. [2018-10-26 20:06:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:33,456 INFO L93 Difference]: Finished difference Result 121 states and 211 transitions. [2018-10-26 20:06:33,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:33,459 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:06:33,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:33,460 INFO L225 Difference]: With dead ends: 121 [2018-10-26 20:06:33,460 INFO L226 Difference]: Without dead ends: 84 [2018-10-26 20:06:33,460 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-10-26 20:06:33,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-26 20:06:33,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2018-10-26 20:06:33,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-26 20:06:33,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 142 transitions. [2018-10-26 20:06:33,471 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 142 transitions. Word has length 23 [2018-10-26 20:06:33,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:33,471 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 142 transitions. [2018-10-26 20:06:33,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 142 transitions. [2018-10-26 20:06:33,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:06:33,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:33,472 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-10-26 20:06:33,472 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:33,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1581564780, now seen corresponding path program 1 times [2018-10-26 20:06:33,473 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:33,473 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,474 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:33,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,474 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:33,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:33,520 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:33,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:33,521 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:33,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:33,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:33,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:33,521 INFO L87 Difference]: Start difference. First operand 82 states and 142 transitions. Second operand 3 states. [2018-10-26 20:06:33,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:33,556 INFO L93 Difference]: Finished difference Result 153 states and 269 transitions. [2018-10-26 20:06:33,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:33,560 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:06:33,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:33,561 INFO L225 Difference]: With dead ends: 153 [2018-10-26 20:06:33,561 INFO L226 Difference]: Without dead ends: 151 [2018-10-26 20:06:33,562 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-10-26 20:06:33,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-26 20:06:33,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 107. [2018-10-26 20:06:33,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-26 20:06:33,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 187 transitions. [2018-10-26 20:06:33,581 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 187 transitions. Word has length 23 [2018-10-26 20:06:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:33,581 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 187 transitions. [2018-10-26 20:06:33,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:33,582 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 187 transitions. [2018-10-26 20:06:33,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-26 20:06:33,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:33,582 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-10-26 20:06:33,583 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:33,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:33,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1702285266, now seen corresponding path program 1 times [2018-10-26 20:06:33,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:33,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:33,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:33,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:33,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:33,686 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:33,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:33,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:33,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:33,687 INFO L87 Difference]: Start difference. First operand 107 states and 187 transitions. Second operand 3 states. [2018-10-26 20:06:33,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:33,786 INFO L93 Difference]: Finished difference Result 251 states and 445 transitions. [2018-10-26 20:06:33,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:33,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-26 20:06:33,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:33,788 INFO L225 Difference]: With dead ends: 251 [2018-10-26 20:06:33,788 INFO L226 Difference]: Without dead ends: 153 [2018-10-26 20:06:33,788 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-10-26 20:06:33,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-26 20:06:33,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2018-10-26 20:06:33,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-26 20:06:33,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 263 transitions. [2018-10-26 20:06:33,801 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 263 transitions. Word has length 23 [2018-10-26 20:06:33,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:33,801 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 263 transitions. [2018-10-26 20:06:33,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:33,801 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 263 transitions. [2018-10-26 20:06:33,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:06:33,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:33,802 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-10-26 20:06:33,802 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:33,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:33,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1783654526, now seen corresponding path program 1 times [2018-10-26 20:06:33,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:33,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:33,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,807 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:33,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:33,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:33,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:33,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:33,852 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:33,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:33,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:33,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:33,853 INFO L87 Difference]: Start difference. First operand 151 states and 263 transitions. Second operand 3 states. [2018-10-26 20:06:33,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:33,898 INFO L93 Difference]: Finished difference Result 226 states and 392 transitions. [2018-10-26 20:06:33,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:33,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:06:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:33,899 INFO L225 Difference]: With dead ends: 226 [2018-10-26 20:06:33,899 INFO L226 Difference]: Without dead ends: 155 [2018-10-26 20:06:33,899 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-10-26 20:06:33,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-26 20:06:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-26 20:06:33,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-26 20:06:33,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 263 transitions. [2018-10-26 20:06:33,907 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 263 transitions. Word has length 24 [2018-10-26 20:06:33,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:33,907 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 263 transitions. [2018-10-26 20:06:33,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:33,908 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 263 transitions. [2018-10-26 20:06:33,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:06:33,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:33,908 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-10-26 20:06:33,909 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:33,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:33,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1231449092, now seen corresponding path program 1 times [2018-10-26 20:06:33,909 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:33,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,910 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:33,910 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:33,910 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:33,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:33,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:33,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:33,978 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:33,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:33,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:33,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:33,979 INFO L87 Difference]: Start difference. First operand 153 states and 263 transitions. Second operand 3 states. [2018-10-26 20:06:34,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:34,017 INFO L93 Difference]: Finished difference Result 285 states and 497 transitions. [2018-10-26 20:06:34,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:34,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:06:34,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:34,019 INFO L225 Difference]: With dead ends: 285 [2018-10-26 20:06:34,019 INFO L226 Difference]: Without dead ends: 283 [2018-10-26 20:06:34,019 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-10-26 20:06:34,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-26 20:06:34,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 205. [2018-10-26 20:06:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-26 20:06:34,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 351 transitions. [2018-10-26 20:06:34,048 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 351 transitions. Word has length 24 [2018-10-26 20:06:34,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:34,049 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 351 transitions. [2018-10-26 20:06:34,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 351 transitions. [2018-10-26 20:06:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-26 20:06:34,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:34,050 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-10-26 20:06:34,050 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:34,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash 220331842, now seen corresponding path program 1 times [2018-10-26 20:06:34,051 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:34,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,052 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:34,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:34,122 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:34,122 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:34,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:34,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:34,123 INFO L87 Difference]: Start difference. First operand 205 states and 351 transitions. Second operand 3 states. [2018-10-26 20:06:34,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:34,216 INFO L93 Difference]: Finished difference Result 485 states and 837 transitions. [2018-10-26 20:06:34,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:34,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-26 20:06:34,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:34,218 INFO L225 Difference]: With dead ends: 485 [2018-10-26 20:06:34,218 INFO L226 Difference]: Without dead ends: 291 [2018-10-26 20:06:34,219 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-10-26 20:06:34,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-26 20:06:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-10-26 20:06:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-26 20:06:34,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 491 transitions. [2018-10-26 20:06:34,232 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 491 transitions. Word has length 24 [2018-10-26 20:06:34,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:34,232 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 491 transitions. [2018-10-26 20:06:34,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:34,233 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 491 transitions. [2018-10-26 20:06:34,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:06:34,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:34,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, 1] [2018-10-26 20:06:34,234 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:34,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:34,234 INFO L82 PathProgramCache]: Analyzing trace with hash -479570073, now seen corresponding path program 1 times [2018-10-26 20:06:34,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:34,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:34,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:34,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:34,302 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:34,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:34,303 INFO L87 Difference]: Start difference. First operand 289 states and 491 transitions. Second operand 3 states. [2018-10-26 20:06:34,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:34,356 INFO L93 Difference]: Finished difference Result 433 states and 733 transitions. [2018-10-26 20:06:34,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:34,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:06:34,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:34,358 INFO L225 Difference]: With dead ends: 433 [2018-10-26 20:06:34,358 INFO L226 Difference]: Without dead ends: 295 [2018-10-26 20:06:34,359 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-10-26 20:06:34,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-26 20:06:34,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-10-26 20:06:34,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-26 20:06:34,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 491 transitions. [2018-10-26 20:06:34,368 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 491 transitions. Word has length 25 [2018-10-26 20:06:34,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:34,368 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 491 transitions. [2018-10-26 20:06:34,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:34,368 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 491 transitions. [2018-10-26 20:06:34,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:06:34,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:34,369 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-10-26 20:06:34,370 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:34,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:34,370 INFO L82 PathProgramCache]: Analyzing trace with hash -1759433751, now seen corresponding path program 1 times [2018-10-26 20:06:34,370 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:34,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:34,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:34,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:34,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:34,405 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:34,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:34,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:34,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:34,406 INFO L87 Difference]: Start difference. First operand 293 states and 491 transitions. Second operand 3 states. [2018-10-26 20:06:34,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:34,439 INFO L93 Difference]: Finished difference Result 541 states and 921 transitions. [2018-10-26 20:06:34,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:34,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:06:34,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:34,442 INFO L225 Difference]: With dead ends: 541 [2018-10-26 20:06:34,442 INFO L226 Difference]: Without dead ends: 539 [2018-10-26 20:06:34,443 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-10-26 20:06:34,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-10-26 20:06:34,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 401. [2018-10-26 20:06:34,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 401 states. [2018-10-26 20:06:34,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 663 transitions. [2018-10-26 20:06:34,456 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 663 transitions. Word has length 25 [2018-10-26 20:06:34,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:34,457 INFO L481 AbstractCegarLoop]: Abstraction has 401 states and 663 transitions. [2018-10-26 20:06:34,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:34,457 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 663 transitions. [2018-10-26 20:06:34,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-26 20:06:34,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:34,460 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-10-26 20:06:34,460 INFO L424 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:34,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1524416295, now seen corresponding path program 1 times [2018-10-26 20:06:34,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:34,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:34,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:34,496 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:34,497 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:34,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:34,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:34,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:34,497 INFO L87 Difference]: Start difference. First operand 401 states and 663 transitions. Second operand 3 states. [2018-10-26 20:06:34,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:34,582 INFO L93 Difference]: Finished difference Result 949 states and 1577 transitions. [2018-10-26 20:06:34,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:34,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-10-26 20:06:34,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:34,585 INFO L225 Difference]: With dead ends: 949 [2018-10-26 20:06:34,585 INFO L226 Difference]: Without dead ends: 563 [2018-10-26 20:06:34,586 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-10-26 20:06:34,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2018-10-26 20:06:34,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 561. [2018-10-26 20:06:34,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-10-26 20:06:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 919 transitions. [2018-10-26 20:06:34,605 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 919 transitions. Word has length 25 [2018-10-26 20:06:34,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:34,606 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 919 transitions. [2018-10-26 20:06:34,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:34,606 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 919 transitions. [2018-10-26 20:06:34,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:06:34,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:34,608 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-10-26 20:06:34,608 INFO L424 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:34,608 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:34,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1292342647, now seen corresponding path program 1 times [2018-10-26 20:06:34,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:34,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:34,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,611 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:34,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:34,697 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:34,697 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:34,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:34,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:34,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:34,698 INFO L87 Difference]: Start difference. First operand 561 states and 919 transitions. Second operand 3 states. [2018-10-26 20:06:34,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:34,786 INFO L93 Difference]: Finished difference Result 841 states and 1373 transitions. [2018-10-26 20:06:34,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:34,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:06:34,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:34,788 INFO L225 Difference]: With dead ends: 841 [2018-10-26 20:06:34,788 INFO L226 Difference]: Without dead ends: 571 [2018-10-26 20:06:34,789 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-10-26 20:06:34,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2018-10-26 20:06:34,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 569. [2018-10-26 20:06:34,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-10-26 20:06:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 919 transitions. [2018-10-26 20:06:34,807 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 919 transitions. Word has length 26 [2018-10-26 20:06:34,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:34,807 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 919 transitions. [2018-10-26 20:06:34,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:34,808 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 919 transitions. [2018-10-26 20:06:34,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:06:34,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:34,809 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-10-26 20:06:34,809 INFO L424 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:34,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:34,809 INFO L82 PathProgramCache]: Analyzing trace with hash 12478969, now seen corresponding path program 1 times [2018-10-26 20:06:34,809 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:34,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:34,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:34,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:34,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:34,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:34,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:34,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:34,877 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:34,877 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:34,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:34,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:34,878 INFO L87 Difference]: Start difference. First operand 569 states and 919 transitions. Second operand 3 states. [2018-10-26 20:06:34,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:34,997 INFO L93 Difference]: Finished difference Result 1645 states and 2649 transitions. [2018-10-26 20:06:34,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:34,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:06:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:35,002 INFO L225 Difference]: With dead ends: 1645 [2018-10-26 20:06:35,002 INFO L226 Difference]: Without dead ends: 1099 [2018-10-26 20:06:35,003 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-10-26 20:06:35,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2018-10-26 20:06:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 1097. [2018-10-26 20:06:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-10-26 20:06:35,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1735 transitions. [2018-10-26 20:06:35,038 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1735 transitions. Word has length 26 [2018-10-26 20:06:35,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:35,038 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1735 transitions. [2018-10-26 20:06:35,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:35,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1735 transitions. [2018-10-26 20:06:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-26 20:06:35,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:35,041 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-10-26 20:06:35,041 INFO L424 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:35,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:35,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1023596219, now seen corresponding path program 1 times [2018-10-26 20:06:35,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,045 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:35,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:35,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:35,113 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:35,113 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:35,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:35,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:35,114 INFO L87 Difference]: Start difference. First operand 1097 states and 1735 transitions. Second operand 3 states. [2018-10-26 20:06:35,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:35,200 INFO L93 Difference]: Finished difference Result 1341 states and 2169 transitions. [2018-10-26 20:06:35,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:35,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-10-26 20:06:35,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:35,205 INFO L225 Difference]: With dead ends: 1341 [2018-10-26 20:06:35,206 INFO L226 Difference]: Without dead ends: 1339 [2018-10-26 20:06:35,208 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-10-26 20:06:35,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2018-10-26 20:06:35,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1097. [2018-10-26 20:06:35,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1097 states. [2018-10-26 20:06:35,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1097 states to 1097 states and 1719 transitions. [2018-10-26 20:06:35,247 INFO L78 Accepts]: Start accepts. Automaton has 1097 states and 1719 transitions. Word has length 26 [2018-10-26 20:06:35,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:35,248 INFO L481 AbstractCegarLoop]: Abstraction has 1097 states and 1719 transitions. [2018-10-26 20:06:35,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:35,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1097 states and 1719 transitions. [2018-10-26 20:06:35,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 20:06:35,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:35,249 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-10-26 20:06:35,250 INFO L424 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:35,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:35,250 INFO L82 PathProgramCache]: Analyzing trace with hash 387062460, now seen corresponding path program 1 times [2018-10-26 20:06:35,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:35,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:35,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,251 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:35,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:35,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:35,322 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:35,322 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:35,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:35,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:35,322 INFO L87 Difference]: Start difference. First operand 1097 states and 1719 transitions. Second operand 3 states. [2018-10-26 20:06:35,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:35,441 INFO L93 Difference]: Finished difference Result 1981 states and 3161 transitions. [2018-10-26 20:06:35,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:35,442 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 20:06:35,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:35,448 INFO L225 Difference]: With dead ends: 1981 [2018-10-26 20:06:35,449 INFO L226 Difference]: Without dead ends: 1979 [2018-10-26 20:06:35,450 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-10-26 20:06:35,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2018-10-26 20:06:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1561. [2018-10-26 20:06:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1561 states. [2018-10-26 20:06:35,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1561 states to 1561 states and 2391 transitions. [2018-10-26 20:06:35,503 INFO L78 Accepts]: Start accepts. Automaton has 1561 states and 2391 transitions. Word has length 27 [2018-10-26 20:06:35,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:35,504 INFO L481 AbstractCegarLoop]: Abstraction has 1561 states and 2391 transitions. [2018-10-26 20:06:35,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:35,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1561 states and 2391 transitions. [2018-10-26 20:06:35,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-26 20:06:35,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:35,508 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-10-26 20:06:35,509 INFO L424 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:35,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash -624054790, now seen corresponding path program 1 times [2018-10-26 20:06:35,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:35,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:35,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:35,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:35,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:35,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:35,581 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:35,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:35,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:35,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:35,582 INFO L87 Difference]: Start difference. First operand 1561 states and 2391 transitions. Second operand 3 states. [2018-10-26 20:06:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:35,717 INFO L93 Difference]: Finished difference Result 3677 states and 5657 transitions. [2018-10-26 20:06:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:35,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-10-26 20:06:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:35,740 INFO L225 Difference]: With dead ends: 3677 [2018-10-26 20:06:35,741 INFO L226 Difference]: Without dead ends: 2139 [2018-10-26 20:06:35,742 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-10-26 20:06:35,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2018-10-26 20:06:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 2137. [2018-10-26 20:06:35,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2137 states. [2018-10-26 20:06:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2137 states to 2137 states and 3239 transitions. [2018-10-26 20:06:35,800 INFO L78 Accepts]: Start accepts. Automaton has 2137 states and 3239 transitions. Word has length 27 [2018-10-26 20:06:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:35,800 INFO L481 AbstractCegarLoop]: Abstraction has 2137 states and 3239 transitions. [2018-10-26 20:06:35,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2137 states and 3239 transitions. [2018-10-26 20:06:35,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 20:06:35,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:35,802 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-10-26 20:06:35,802 INFO L424 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:35,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:35,803 INFO L82 PathProgramCache]: Analyzing trace with hash -885750866, now seen corresponding path program 1 times [2018-10-26 20:06:35,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:35,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:35,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:35,806 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:35,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:35,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:35,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:35,873 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:35,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:35,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:35,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:35,874 INFO L87 Difference]: Start difference. First operand 2137 states and 3239 transitions. Second operand 3 states. [2018-10-26 20:06:35,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:35,993 INFO L93 Difference]: Finished difference Result 3229 states and 4889 transitions. [2018-10-26 20:06:35,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:35,994 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 20:06:35,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:36,001 INFO L225 Difference]: With dead ends: 3229 [2018-10-26 20:06:36,001 INFO L226 Difference]: Without dead ends: 2187 [2018-10-26 20:06:36,003 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-10-26 20:06:36,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2187 states. [2018-10-26 20:06:36,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2187 to 2185. [2018-10-26 20:06:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2185 states. [2018-10-26 20:06:36,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2185 states to 2185 states and 3271 transitions. [2018-10-26 20:06:36,059 INFO L78 Accepts]: Start accepts. Automaton has 2185 states and 3271 transitions. Word has length 28 [2018-10-26 20:06:36,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:36,059 INFO L481 AbstractCegarLoop]: Abstraction has 2185 states and 3271 transitions. [2018-10-26 20:06:36,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:36,060 INFO L276 IsEmpty]: Start isEmpty. Operand 2185 states and 3271 transitions. [2018-10-26 20:06:36,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 20:06:36,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:36,062 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-10-26 20:06:36,062 INFO L424 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:36,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:36,062 INFO L82 PathProgramCache]: Analyzing trace with hash 2129352752, now seen corresponding path program 1 times [2018-10-26 20:06:36,062 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:36,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:36,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:36,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:36,067 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:36,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:36,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:36,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:36,137 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:36,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:36,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:36,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:36,138 INFO L87 Difference]: Start difference. First operand 2185 states and 3271 transitions. Second operand 3 states. [2018-10-26 20:06:36,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:36,279 INFO L93 Difference]: Finished difference Result 3853 states and 5865 transitions. [2018-10-26 20:06:36,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:36,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 20:06:36,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:36,290 INFO L225 Difference]: With dead ends: 3853 [2018-10-26 20:06:36,291 INFO L226 Difference]: Without dead ends: 3851 [2018-10-26 20:06:36,292 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-10-26 20:06:36,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-10-26 20:06:36,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3145. [2018-10-26 20:06:36,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3145 states. [2018-10-26 20:06:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3145 states to 3145 states and 4583 transitions. [2018-10-26 20:06:36,364 INFO L78 Accepts]: Start accepts. Automaton has 3145 states and 4583 transitions. Word has length 28 [2018-10-26 20:06:36,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:36,365 INFO L481 AbstractCegarLoop]: Abstraction has 3145 states and 4583 transitions. [2018-10-26 20:06:36,365 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:36,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3145 states and 4583 transitions. [2018-10-26 20:06:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-26 20:06:36,370 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:36,370 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-10-26 20:06:36,371 INFO L424 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:36,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:36,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1118235502, now seen corresponding path program 1 times [2018-10-26 20:06:36,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:36,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:36,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:36,372 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:36,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:36,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:36,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:36,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:36,436 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:36,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:36,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:36,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:36,437 INFO L87 Difference]: Start difference. First operand 3145 states and 4583 transitions. Second operand 3 states. [2018-10-26 20:06:36,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:36,542 INFO L93 Difference]: Finished difference Result 7309 states and 10665 transitions. [2018-10-26 20:06:36,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:36,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-10-26 20:06:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:36,555 INFO L225 Difference]: With dead ends: 7309 [2018-10-26 20:06:36,555 INFO L226 Difference]: Without dead ends: 4235 [2018-10-26 20:06:36,560 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-10-26 20:06:36,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4235 states. [2018-10-26 20:06:36,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4235 to 4233. [2018-10-26 20:06:36,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4233 states. [2018-10-26 20:06:36,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4233 states to 4233 states and 6087 transitions. [2018-10-26 20:06:36,659 INFO L78 Accepts]: Start accepts. Automaton has 4233 states and 6087 transitions. Word has length 28 [2018-10-26 20:06:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:36,660 INFO L481 AbstractCegarLoop]: Abstraction has 4233 states and 6087 transitions. [2018-10-26 20:06:36,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:36,660 INFO L276 IsEmpty]: Start isEmpty. Operand 4233 states and 6087 transitions. [2018-10-26 20:06:36,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 20:06:36,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:36,664 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-10-26 20:06:36,665 INFO L424 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:36,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:36,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1585640975, now seen corresponding path program 1 times [2018-10-26 20:06:36,665 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:36,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:36,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:36,666 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:36,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:36,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:36,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:36,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:36,733 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:36,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:36,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:36,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:36,733 INFO L87 Difference]: Start difference. First operand 4233 states and 6087 transitions. Second operand 3 states. [2018-10-26 20:06:36,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:36,867 INFO L93 Difference]: Finished difference Result 6349 states and 9097 transitions. [2018-10-26 20:06:36,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:36,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 20:06:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:36,879 INFO L225 Difference]: With dead ends: 6349 [2018-10-26 20:06:36,879 INFO L226 Difference]: Without dead ends: 4299 [2018-10-26 20:06:36,883 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-10-26 20:06:36,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4299 states. [2018-10-26 20:06:36,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4299 to 4297. [2018-10-26 20:06:36,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4297 states. [2018-10-26 20:06:37,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4297 states to 4297 states and 6087 transitions. [2018-10-26 20:06:37,010 INFO L78 Accepts]: Start accepts. Automaton has 4297 states and 6087 transitions. Word has length 29 [2018-10-26 20:06:37,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:37,010 INFO L481 AbstractCegarLoop]: Abstraction has 4297 states and 6087 transitions. [2018-10-26 20:06:37,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:37,010 INFO L276 IsEmpty]: Start isEmpty. Operand 4297 states and 6087 transitions. [2018-10-26 20:06:37,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 20:06:37,015 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:37,015 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-10-26 20:06:37,015 INFO L424 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:37,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:37,015 INFO L82 PathProgramCache]: Analyzing trace with hash 305777297, now seen corresponding path program 1 times [2018-10-26 20:06:37,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:37,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,016 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:37,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:37,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:37,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:37,079 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:37,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:37,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:37,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:37,080 INFO L87 Difference]: Start difference. First operand 4297 states and 6087 transitions. Second operand 3 states. [2018-10-26 20:06:37,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:37,257 INFO L93 Difference]: Finished difference Result 7437 states and 10697 transitions. [2018-10-26 20:06:37,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:37,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 20:06:37,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:37,272 INFO L225 Difference]: With dead ends: 7437 [2018-10-26 20:06:37,272 INFO L226 Difference]: Without dead ends: 7435 [2018-10-26 20:06:37,275 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-10-26 20:06:37,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2018-10-26 20:06:37,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 6281. [2018-10-26 20:06:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6281 states. [2018-10-26 20:06:37,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6281 states to 6281 states and 8647 transitions. [2018-10-26 20:06:37,406 INFO L78 Accepts]: Start accepts. Automaton has 6281 states and 8647 transitions. Word has length 29 [2018-10-26 20:06:37,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:37,407 INFO L481 AbstractCegarLoop]: Abstraction has 6281 states and 8647 transitions. [2018-10-26 20:06:37,407 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:37,407 INFO L276 IsEmpty]: Start isEmpty. Operand 6281 states and 8647 transitions. [2018-10-26 20:06:37,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-26 20:06:37,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:37,414 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-10-26 20:06:37,415 INFO L424 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:37,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:37,415 INFO L82 PathProgramCache]: Analyzing trace with hash -705339953, now seen corresponding path program 1 times [2018-10-26 20:06:37,415 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:37,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:37,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:37,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:37,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:37,477 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:37,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:37,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:37,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:37,478 INFO L87 Difference]: Start difference. First operand 6281 states and 8647 transitions. Second operand 3 states. [2018-10-26 20:06:37,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:37,684 INFO L93 Difference]: Finished difference Result 14477 states and 19913 transitions. [2018-10-26 20:06:37,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:37,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-10-26 20:06:37,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:37,699 INFO L225 Difference]: With dead ends: 14477 [2018-10-26 20:06:37,699 INFO L226 Difference]: Without dead ends: 8331 [2018-10-26 20:06:37,708 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-10-26 20:06:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8331 states. [2018-10-26 20:06:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8331 to 8329. [2018-10-26 20:06:37,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8329 states. [2018-10-26 20:06:37,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8329 states to 8329 states and 11271 transitions. [2018-10-26 20:06:37,902 INFO L78 Accepts]: Start accepts. Automaton has 8329 states and 11271 transitions. Word has length 29 [2018-10-26 20:06:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:37,902 INFO L481 AbstractCegarLoop]: Abstraction has 8329 states and 11271 transitions. [2018-10-26 20:06:37,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 8329 states and 11271 transitions. [2018-10-26 20:06:37,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:06:37,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:37,911 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-10-26 20:06:37,911 INFO L424 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:37,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:37,912 INFO L82 PathProgramCache]: Analyzing trace with hash 889377059, now seen corresponding path program 1 times [2018-10-26 20:06:37,913 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:37,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:37,913 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:37,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:37,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:37,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:37,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:37,981 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:37,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:37,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:37,981 INFO L87 Difference]: Start difference. First operand 8329 states and 11271 transitions. Second operand 3 states. [2018-10-26 20:06:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:38,213 INFO L93 Difference]: Finished difference Result 12493 states and 16841 transitions. [2018-10-26 20:06:38,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:38,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 20:06:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:38,226 INFO L225 Difference]: With dead ends: 12493 [2018-10-26 20:06:38,226 INFO L226 Difference]: Without dead ends: 8459 [2018-10-26 20:06:38,232 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-10-26 20:06:38,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8459 states. [2018-10-26 20:06:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8459 to 8457. [2018-10-26 20:06:38,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8457 states. [2018-10-26 20:06:38,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8457 states to 8457 states and 11271 transitions. [2018-10-26 20:06:38,408 INFO L78 Accepts]: Start accepts. Automaton has 8457 states and 11271 transitions. Word has length 30 [2018-10-26 20:06:38,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:38,408 INFO L481 AbstractCegarLoop]: Abstraction has 8457 states and 11271 transitions. [2018-10-26 20:06:38,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:38,408 INFO L276 IsEmpty]: Start isEmpty. Operand 8457 states and 11271 transitions. [2018-10-26 20:06:38,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:06:38,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:38,417 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-10-26 20:06:38,417 INFO L424 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:38,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:38,417 INFO L82 PathProgramCache]: Analyzing trace with hash -390486619, now seen corresponding path program 1 times [2018-10-26 20:06:38,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:38,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:38,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:38,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:38,418 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:38,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:38,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:38,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:38,481 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:38,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:38,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:38,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:38,482 INFO L87 Difference]: Start difference. First operand 8457 states and 11271 transitions. Second operand 3 states. [2018-10-26 20:06:38,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:38,734 INFO L93 Difference]: Finished difference Result 14349 states and 19337 transitions. [2018-10-26 20:06:38,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:38,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 20:06:38,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:38,757 INFO L225 Difference]: With dead ends: 14349 [2018-10-26 20:06:38,757 INFO L226 Difference]: Without dead ends: 14347 [2018-10-26 20:06:38,762 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-10-26 20:06:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14347 states. [2018-10-26 20:06:39,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14347 to 12553. [2018-10-26 20:06:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12553 states. [2018-10-26 20:06:39,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12553 states to 12553 states and 16263 transitions. [2018-10-26 20:06:39,067 INFO L78 Accepts]: Start accepts. Automaton has 12553 states and 16263 transitions. Word has length 30 [2018-10-26 20:06:39,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:39,068 INFO L481 AbstractCegarLoop]: Abstraction has 12553 states and 16263 transitions. [2018-10-26 20:06:39,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:39,068 INFO L276 IsEmpty]: Start isEmpty. Operand 12553 states and 16263 transitions. [2018-10-26 20:06:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-26 20:06:39,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:39,081 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-10-26 20:06:39,081 INFO L424 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:39,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:39,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1401603869, now seen corresponding path program 1 times [2018-10-26 20:06:39,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:39,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:39,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:39,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:39,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:39,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:39,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:39,145 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:39,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:39,145 INFO L87 Difference]: Start difference. First operand 12553 states and 16263 transitions. Second operand 3 states. [2018-10-26 20:06:39,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:39,447 INFO L93 Difference]: Finished difference Result 28685 states and 37001 transitions. [2018-10-26 20:06:39,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:39,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-10-26 20:06:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:39,471 INFO L225 Difference]: With dead ends: 28685 [2018-10-26 20:06:39,472 INFO L226 Difference]: Without dead ends: 16395 [2018-10-26 20:06:39,487 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-10-26 20:06:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16395 states. [2018-10-26 20:06:39,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16395 to 16393. [2018-10-26 20:06:39,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16393 states. [2018-10-26 20:06:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16393 states to 16393 states and 20743 transitions. [2018-10-26 20:06:39,815 INFO L78 Accepts]: Start accepts. Automaton has 16393 states and 20743 transitions. Word has length 30 [2018-10-26 20:06:39,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:39,815 INFO L481 AbstractCegarLoop]: Abstraction has 16393 states and 20743 transitions. [2018-10-26 20:06:39,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:39,815 INFO L276 IsEmpty]: Start isEmpty. Operand 16393 states and 20743 transitions. [2018-10-26 20:06:39,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 20:06:39,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:39,830 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-10-26 20:06:39,830 INFO L424 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:39,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:39,830 INFO L82 PathProgramCache]: Analyzing trace with hash 780032484, now seen corresponding path program 1 times [2018-10-26 20:06:39,830 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:39,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:39,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:39,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:39,832 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:39,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:39,893 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:39,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:39,893 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:39,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:39,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:39,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:39,894 INFO L87 Difference]: Start difference. First operand 16393 states and 20743 transitions. Second operand 3 states. [2018-10-26 20:06:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:40,271 INFO L93 Difference]: Finished difference Result 24589 states and 30985 transitions. [2018-10-26 20:06:40,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:40,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 20:06:40,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:40,291 INFO L225 Difference]: With dead ends: 24589 [2018-10-26 20:06:40,291 INFO L226 Difference]: Without dead ends: 16651 [2018-10-26 20:06:40,301 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-10-26 20:06:40,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16651 states. [2018-10-26 20:06:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16651 to 16649. [2018-10-26 20:06:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16649 states. [2018-10-26 20:06:40,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16649 states to 16649 states and 20743 transitions. [2018-10-26 20:06:40,620 INFO L78 Accepts]: Start accepts. Automaton has 16649 states and 20743 transitions. Word has length 31 [2018-10-26 20:06:40,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:40,620 INFO L481 AbstractCegarLoop]: Abstraction has 16649 states and 20743 transitions. [2018-10-26 20:06:40,620 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:40,620 INFO L276 IsEmpty]: Start isEmpty. Operand 16649 states and 20743 transitions. [2018-10-26 20:06:40,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 20:06:40,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:40,633 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-10-26 20:06:40,633 INFO L424 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:40,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:40,634 INFO L82 PathProgramCache]: Analyzing trace with hash -499831194, now seen corresponding path program 1 times [2018-10-26 20:06:40,634 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:40,634 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:40,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:40,634 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:40,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:40,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:40,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:40,704 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:40,705 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:40,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:40,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:40,705 INFO L87 Difference]: Start difference. First operand 16649 states and 20743 transitions. Second operand 3 states. [2018-10-26 20:06:41,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:41,163 INFO L93 Difference]: Finished difference Result 27661 states and 34569 transitions. [2018-10-26 20:06:41,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:41,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 20:06:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:41,187 INFO L225 Difference]: With dead ends: 27661 [2018-10-26 20:06:41,187 INFO L226 Difference]: Without dead ends: 27659 [2018-10-26 20:06:41,190 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-10-26 20:06:41,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27659 states. [2018-10-26 20:06:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27659 to 25097. [2018-10-26 20:06:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25097 states. [2018-10-26 20:06:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25097 states to 25097 states and 30471 transitions. [2018-10-26 20:06:41,569 INFO L78 Accepts]: Start accepts. Automaton has 25097 states and 30471 transitions. Word has length 31 [2018-10-26 20:06:41,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:41,570 INFO L481 AbstractCegarLoop]: Abstraction has 25097 states and 30471 transitions. [2018-10-26 20:06:41,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:41,570 INFO L276 IsEmpty]: Start isEmpty. Operand 25097 states and 30471 transitions. [2018-10-26 20:06:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-26 20:06:41,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:41,590 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-10-26 20:06:41,590 INFO L424 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:41,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1510948444, now seen corresponding path program 1 times [2018-10-26 20:06:41,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:41,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:41,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:41,591 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:41,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:41,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:41,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:41,657 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:41,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:41,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:41,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:41,658 INFO L87 Difference]: Start difference. First operand 25097 states and 30471 transitions. Second operand 3 states. [2018-10-26 20:06:42,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:42,121 INFO L93 Difference]: Finished difference Result 56845 states and 68361 transitions. [2018-10-26 20:06:42,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:42,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-10-26 20:06:42,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:42,153 INFO L225 Difference]: With dead ends: 56845 [2018-10-26 20:06:42,153 INFO L226 Difference]: Without dead ends: 32267 [2018-10-26 20:06:42,187 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-10-26 20:06:42,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32267 states. [2018-10-26 20:06:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32267 to 32265. [2018-10-26 20:06:42,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32265 states. [2018-10-26 20:06:42,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32265 states to 32265 states and 37895 transitions. [2018-10-26 20:06:42,867 INFO L78 Accepts]: Start accepts. Automaton has 32265 states and 37895 transitions. Word has length 31 [2018-10-26 20:06:42,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:42,868 INFO L481 AbstractCegarLoop]: Abstraction has 32265 states and 37895 transitions. [2018-10-26 20:06:42,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:42,868 INFO L276 IsEmpty]: Start isEmpty. Operand 32265 states and 37895 transitions. [2018-10-26 20:06:42,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 20:06:42,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:42,878 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-10-26 20:06:42,878 INFO L424 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:42,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:42,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1685318296, now seen corresponding path program 1 times [2018-10-26 20:06:42,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:42,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:42,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:42,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:42,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:42,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:42,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:42,940 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:42,941 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:42,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:42,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:42,941 INFO L87 Difference]: Start difference. First operand 32265 states and 37895 transitions. Second operand 3 states. [2018-10-26 20:06:43,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:43,277 INFO L93 Difference]: Finished difference Result 48397 states and 56585 transitions. [2018-10-26 20:06:43,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:43,278 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 20:06:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:43,304 INFO L225 Difference]: With dead ends: 48397 [2018-10-26 20:06:43,304 INFO L226 Difference]: Without dead ends: 32779 [2018-10-26 20:06:43,317 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-10-26 20:06:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32779 states. [2018-10-26 20:06:43,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32779 to 32777. [2018-10-26 20:06:43,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32777 states. [2018-10-26 20:06:43,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32777 states to 32777 states and 37895 transitions. [2018-10-26 20:06:43,949 INFO L78 Accepts]: Start accepts. Automaton has 32777 states and 37895 transitions. Word has length 32 [2018-10-26 20:06:43,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:43,949 INFO L481 AbstractCegarLoop]: Abstraction has 32777 states and 37895 transitions. [2018-10-26 20:06:43,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:43,949 INFO L276 IsEmpty]: Start isEmpty. Operand 32777 states and 37895 transitions. [2018-10-26 20:06:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 20:06:43,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:43,959 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-10-26 20:06:43,959 INFO L424 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:43,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:43,960 INFO L82 PathProgramCache]: Analyzing trace with hash 405454618, now seen corresponding path program 1 times [2018-10-26 20:06:43,960 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:43,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:43,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:43,961 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:43,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:43,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:43,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:43,996 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:43,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:43,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:43,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:43,997 INFO L87 Difference]: Start difference. First operand 32777 states and 37895 transitions. Second operand 3 states. [2018-10-26 20:06:44,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:44,548 INFO L93 Difference]: Finished difference Result 53259 states and 60936 transitions. [2018-10-26 20:06:44,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:44,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 20:06:44,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:44,584 INFO L225 Difference]: With dead ends: 53259 [2018-10-26 20:06:44,584 INFO L226 Difference]: Without dead ends: 53257 [2018-10-26 20:06:44,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-10-26 20:06:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53257 states. [2018-10-26 20:06:45,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53257 to 50185. [2018-10-26 20:06:45,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50185 states. [2018-10-26 20:06:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50185 states to 50185 states and 56839 transitions. [2018-10-26 20:06:45,432 INFO L78 Accepts]: Start accepts. Automaton has 50185 states and 56839 transitions. Word has length 32 [2018-10-26 20:06:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:45,432 INFO L481 AbstractCegarLoop]: Abstraction has 50185 states and 56839 transitions. [2018-10-26 20:06:45,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:45,432 INFO L276 IsEmpty]: Start isEmpty. Operand 50185 states and 56839 transitions. [2018-10-26 20:06:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-26 20:06:45,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-26 20:06:45,460 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-10-26 20:06:45,460 INFO L424 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-26 20:06:45,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-26 20:06:45,460 INFO L82 PathProgramCache]: Analyzing trace with hash -605662632, now seen corresponding path program 1 times [2018-10-26 20:06:45,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-26 20:06:45,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:45,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-26 20:06:45,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-26 20:06:45,461 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-26 20:06:45,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-26 20:06:45,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-26 20:06:45,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-26 20:06:45,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-26 20:06:45,525 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-26 20:06:45,525 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-26 20:06:45,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-26 20:06:45,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-26 20:06:45,526 INFO L87 Difference]: Start difference. First operand 50185 states and 56839 transitions. Second operand 3 states. [2018-10-26 20:06:46,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-26 20:06:46,728 INFO L93 Difference]: Finished difference Result 112649 states and 125447 transitions. [2018-10-26 20:06:46,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-26 20:06:46,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-10-26 20:06:46,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-26 20:06:46,729 INFO L225 Difference]: With dead ends: 112649 [2018-10-26 20:06:46,729 INFO L226 Difference]: Without dead ends: 0 [2018-10-26 20:06:46,789 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-10-26 20:06:46,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-26 20:06:46,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-26 20:06:46,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-26 20:06:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-26 20:06:46,790 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2018-10-26 20:06:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-26 20:06:46,790 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-26 20:06:46,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-26 20:06:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-26 20:06:46,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-26 20:06:46,794 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-10-26 20:06:46,914 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-10-26 20:06:46,914 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:06:46,914 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-10-26 20:06:46,914 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-10-26 20:06:46,914 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-10-26 20:06:46,914 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-10-26 20:06:46,914 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2018-10-26 20:06:46,914 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-10-26 20:06:46,914 INFO L425 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L421 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L103-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L95-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-10-26 20:06:46,915 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L79-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L71(lines 71 73) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L71-2(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-10-26 20:06:46,916 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L428 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L107-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L91-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L83-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L425 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2018-10-26 20:06:46,917 INFO L428 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2018-10-26 20:06:46,922 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.10 08:06:46 BoogieIcfgContainer [2018-10-26 20:06:46,923 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-26 20:06:46,923 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-26 20:06:46,923 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-26 20:06:46,923 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-26 20:06:46,923 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.10 08:06:32" (3/4) ... [2018-10-26 20:06:46,927 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-10-26 20:06:46,934 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-10-26 20:06:46,934 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-10-26 20:06:46,939 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-10-26 20:06:46,940 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-10-26 20:06:46,940 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-10-26 20:06:47,005 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4757a8a3-c34d-47de-91a8-342c6af2ed06/bin-2019/utaipan/witness.graphml [2018-10-26 20:06:47,005 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-26 20:06:47,006 INFO L168 Benchmark]: Toolchain (without parser) took 15051.61 ms. Allocated memory was 1.0 GB in the beginning and 2.2 GB in the end (delta: 1.2 GB). Free memory was 959.8 MB in the beginning and 1.4 GB in the end (delta: -483.8 MB). Peak memory consumption was 686.9 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:47,007 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:06:47,008 INFO L168 Benchmark]: CACSL2BoogieTranslator took 215.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:47,008 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.24 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:47,008 INFO L168 Benchmark]: Boogie Preprocessor took 20.17 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-26 20:06:47,008 INFO L168 Benchmark]: RCFGBuilder took 542.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:47,008 INFO L168 Benchmark]: TraceAbstraction took 14172.81 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -317.4 MB). Peak memory consumption was 699.2 MB. Max. memory is 11.5 GB. [2018-10-26 20:06:47,009 INFO L168 Benchmark]: Witness Printer took 82.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 558.6 kB). Peak memory consumption was 558.6 kB. Max. memory is 11.5 GB. [2018-10-26 20:06:47,010 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 215.65 ms. Allocated memory is still 1.0 GB. Free memory was 959.8 MB in the beginning and 949.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 14.24 ms. Allocated memory is still 1.0 GB. Free memory was 949.1 MB in the beginning and 946.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.17 ms. Allocated memory is still 1.0 GB. Free memory is still 946.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 542.44 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 946.4 MB in the beginning and 1.1 GB in the end (delta: -183.1 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14172.81 ms. Allocated memory was 1.2 GB in the beginning and 2.2 GB in the end (delta: 1.0 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -317.4 MB). Peak memory consumption was 699.2 MB. Max. memory is 11.5 GB. * Witness Printer took 82.31 ms. Allocated memory is still 2.2 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 558.6 kB). Peak memory consumption was 558.6 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 48 locations, 1 error locations. SAFE Result, 14.1s OverallTime, 31 OverallIterations, 1 TraceHistogramMax, 6.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 2942 SDtfs, 1433 SDslu, 1995 SDs, 0 SdLazy, 165 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50185occurred in iteration=30, 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: 4.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 10271 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 2058 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 842 NumberOfCodeBlocks, 842 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 811 ConstructedInterpolants, 0 QuantifiedInterpolants, 42564 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...