./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fc492c809d432e4c3053fa8c39191c1c15ea4eea ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 13:21:33,983 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 13:21:33,984 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 13:21:33,991 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 13:21:33,991 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 13:21:33,992 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 13:21:33,992 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 13:21:33,994 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 13:21:33,995 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 13:21:33,995 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 13:21:33,996 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 13:21:33,996 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 13:21:33,997 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 13:21:33,998 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 13:21:33,999 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 13:21:33,999 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 13:21:33,999 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 13:21:34,001 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 13:21:34,002 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 13:21:34,003 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 13:21:34,004 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 13:21:34,005 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 13:21:34,007 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 13:21:34,007 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 13:21:34,007 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 13:21:34,008 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 13:21:34,009 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 13:21:34,010 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 13:21:34,010 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 13:21:34,011 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 13:21:34,011 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 13:21:34,011 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 13:21:34,012 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 13:21:34,012 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 13:21:34,012 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 13:21:34,013 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 13:21:34,014 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-18 13:21:34,024 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 13:21:34,024 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 13:21:34,025 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-18 13:21:34,025 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-18 13:21:34,025 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-18 13:21:34,026 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 13:21:34,026 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 13:21:34,026 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 13:21:34,026 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 13:21:34,026 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 13:21:34,027 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 13:21:34,027 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 13:21:34,027 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 13:21:34,027 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 13:21:34,027 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 13:21:34,027 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 13:21:34,027 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 13:21:34,027 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:21:34,028 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 13:21:34,028 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 13:21:34,028 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_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fc492c809d432e4c3053fa8c39191c1c15ea4eea [2018-11-18 13:21:34,052 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 13:21:34,060 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 13:21:34,062 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 13:21:34,063 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 13:21:34,064 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 13:21:34,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 13:21:34,098 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/data/511f4da4c/6d676b17525f469e9bab4e7cffb16099/FLAG1ad32ea53 [2018-11-18 13:21:34,404 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 13:21:34,404 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/sv-benchmarks/c/locks/test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 13:21:34,409 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/data/511f4da4c/6d676b17525f469e9bab4e7cffb16099/FLAG1ad32ea53 [2018-11-18 13:21:34,417 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/data/511f4da4c/6d676b17525f469e9bab4e7cffb16099 [2018-11-18 13:21:34,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 13:21:34,420 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 13:21:34,420 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 13:21:34,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 13:21:34,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 13:21:34,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3275144b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34, skipping insertion in model container [2018-11-18 13:21:34,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,435 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 13:21:34,450 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 13:21:34,565 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:21:34,568 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 13:21:34,584 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 13:21:34,593 INFO L195 MainTranslator]: Completed translation [2018-11-18 13:21:34,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34 WrapperNode [2018-11-18 13:21:34,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 13:21:34,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 13:21:34,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 13:21:34,594 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 13:21:34,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,606 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 13:21:34,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 13:21:34,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 13:21:34,606 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 13:21:34,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,614 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,619 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... [2018-11-18 13:21:34,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 13:21:34,621 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 13:21:34,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 13:21:34,622 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 13:21:34,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 13:21:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 13:21:34,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 13:21:34,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 13:21:34,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 13:21:34,698 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 13:21:34,698 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 13:21:34,822 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 13:21:34,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:21:34 BoogieIcfgContainer [2018-11-18 13:21:34,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 13:21:34,822 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 13:21:34,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 13:21:34,824 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 13:21:34,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 01:21:34" (1/3) ... [2018-11-18 13:21:34,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f8bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:21:34, skipping insertion in model container [2018-11-18 13:21:34,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 01:21:34" (2/3) ... [2018-11-18 13:21:34,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e9f8bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 01:21:34, skipping insertion in model container [2018-11-18 13:21:34,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:21:34" (3/3) ... [2018-11-18 13:21:34,827 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_6_true-unreach-call_true-valid-memsafety_false-termination.c [2018-11-18 13:21:34,834 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 13:21:34,839 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 13:21:34,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 13:21:34,864 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 13:21:34,864 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 13:21:34,865 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 13:21:34,865 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 13:21:34,865 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 13:21:34,865 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 13:21:34,865 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 13:21:34,865 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 13:21:34,875 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-18 13:21:34,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 13:21:34,879 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:34,879 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:34,881 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:34,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:34,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1169713633, now seen corresponding path program 1 times [2018-11-18 13:21:34,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:34,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:34,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:34,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:34,921 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:34,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:34,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:34,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:34,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:34,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,004 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2018-11-18 13:21:35,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,038 INFO L93 Difference]: Finished difference Result 65 states and 104 transitions. [2018-11-18 13:21:35,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 13:21:35,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,046 INFO L225 Difference]: With dead ends: 65 [2018-11-18 13:21:35,046 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 13:21:35,049 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 13:21:35,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-18 13:21:35,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 13:21:35,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2018-11-18 13:21:35,081 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 17 [2018-11-18 13:21:35,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,081 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2018-11-18 13:21:35,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,081 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2018-11-18 13:21:35,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 13:21:35,082 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,082 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,082 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1849772003, now seen corresponding path program 1 times [2018-11-18 13:21:35,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,126 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 3 states. [2018-11-18 13:21:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,154 INFO L93 Difference]: Finished difference Result 80 states and 135 transitions. [2018-11-18 13:21:35,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 13:21:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,155 INFO L225 Difference]: With dead ends: 80 [2018-11-18 13:21:35,155 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 13:21:35,156 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 13:21:35,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2018-11-18 13:21:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-18 13:21:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 79 transitions. [2018-11-18 13:21:35,161 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 79 transitions. Word has length 17 [2018-11-18 13:21:35,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,161 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 79 transitions. [2018-11-18 13:21:35,162 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,162 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 79 transitions. [2018-11-18 13:21:35,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 13:21:35,162 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,162 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,163 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1901598932, now seen corresponding path program 1 times [2018-11-18 13:21:35,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,188 INFO L87 Difference]: Start difference. First operand 48 states and 79 transitions. Second operand 3 states. [2018-11-18 13:21:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,203 INFO L93 Difference]: Finished difference Result 76 states and 121 transitions. [2018-11-18 13:21:35,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 13:21:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,205 INFO L225 Difference]: With dead ends: 76 [2018-11-18 13:21:35,205 INFO L226 Difference]: Without dead ends: 54 [2018-11-18 13:21:35,205 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-18 13:21:35,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2018-11-18 13:21:35,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-18 13:21:35,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 82 transitions. [2018-11-18 13:21:35,210 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 82 transitions. Word has length 18 [2018-11-18 13:21:35,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,210 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 82 transitions. [2018-11-18 13:21:35,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 82 transitions. [2018-11-18 13:21:35,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 13:21:35,211 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,211 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,211 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1508571922, now seen corresponding path program 1 times [2018-11-18 13:21:35,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,233 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,234 INFO L87 Difference]: Start difference. First operand 52 states and 82 transitions. Second operand 3 states. [2018-11-18 13:21:35,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,255 INFO L93 Difference]: Finished difference Result 93 states and 149 transitions. [2018-11-18 13:21:35,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 13:21:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,256 INFO L225 Difference]: With dead ends: 93 [2018-11-18 13:21:35,257 INFO L226 Difference]: Without dead ends: 91 [2018-11-18 13:21:35,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-11-18 13:21:35,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 67. [2018-11-18 13:21:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-18 13:21:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 107 transitions. [2018-11-18 13:21:35,261 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 107 transitions. Word has length 18 [2018-11-18 13:21:35,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,263 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 107 transitions. [2018-11-18 13:21:35,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 107 transitions. [2018-11-18 13:21:35,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 13:21:35,264 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,264 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,265 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,265 INFO L82 PathProgramCache]: Analyzing trace with hash -2106337004, now seen corresponding path program 1 times [2018-11-18 13:21:35,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,266 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,307 INFO L87 Difference]: Start difference. First operand 67 states and 107 transitions. Second operand 3 states. [2018-11-18 13:21:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,321 INFO L93 Difference]: Finished difference Result 151 states and 245 transitions. [2018-11-18 13:21:35,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-18 13:21:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,322 INFO L225 Difference]: With dead ends: 151 [2018-11-18 13:21:35,322 INFO L226 Difference]: Without dead ends: 93 [2018-11-18 13:21:35,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-18 13:21:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2018-11-18 13:21:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-18 13:21:35,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 143 transitions. [2018-11-18 13:21:35,327 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 143 transitions. Word has length 18 [2018-11-18 13:21:35,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,327 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 143 transitions. [2018-11-18 13:21:35,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,327 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 143 transitions. [2018-11-18 13:21:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 13:21:35,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,328 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,328 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,328 INFO L82 PathProgramCache]: Analyzing trace with hash -478695656, now seen corresponding path program 1 times [2018-11-18 13:21:35,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,354 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,354 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,355 INFO L87 Difference]: Start difference. First operand 91 states and 143 transitions. Second operand 3 states. [2018-11-18 13:21:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,374 INFO L93 Difference]: Finished difference Result 136 states and 212 transitions. [2018-11-18 13:21:35,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 13:21:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,375 INFO L225 Difference]: With dead ends: 136 [2018-11-18 13:21:35,376 INFO L226 Difference]: Without dead ends: 95 [2018-11-18 13:21:35,376 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-18 13:21:35,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2018-11-18 13:21:35,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-11-18 13:21:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 143 transitions. [2018-11-18 13:21:35,383 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 143 transitions. Word has length 19 [2018-11-18 13:21:35,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,383 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 143 transitions. [2018-11-18 13:21:35,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 143 transitions. [2018-11-18 13:21:35,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 13:21:35,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,384 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,384 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,384 INFO L82 PathProgramCache]: Analyzing trace with hash -871722666, now seen corresponding path program 1 times [2018-11-18 13:21:35,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,419 INFO L87 Difference]: Start difference. First operand 93 states and 143 transitions. Second operand 3 states. [2018-11-18 13:21:35,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,431 INFO L93 Difference]: Finished difference Result 165 states and 257 transitions. [2018-11-18 13:21:35,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 13:21:35,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,432 INFO L225 Difference]: With dead ends: 165 [2018-11-18 13:21:35,432 INFO L226 Difference]: Without dead ends: 163 [2018-11-18 13:21:35,432 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-11-18 13:21:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 125. [2018-11-18 13:21:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 13:21:35,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 191 transitions. [2018-11-18 13:21:35,441 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 191 transitions. Word has length 19 [2018-11-18 13:21:35,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,441 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 191 transitions. [2018-11-18 13:21:35,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 191 transitions. [2018-11-18 13:21:35,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-18 13:21:35,442 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,442 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,442 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,442 INFO L82 PathProgramCache]: Analyzing trace with hash -191664296, now seen corresponding path program 1 times [2018-11-18 13:21:35,443 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,443 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,466 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,466 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,467 INFO L87 Difference]: Start difference. First operand 125 states and 191 transitions. Second operand 3 states. [2018-11-18 13:21:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,490 INFO L93 Difference]: Finished difference Result 285 states and 437 transitions. [2018-11-18 13:21:35,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,490 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-18 13:21:35,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,491 INFO L225 Difference]: With dead ends: 285 [2018-11-18 13:21:35,491 INFO L226 Difference]: Without dead ends: 171 [2018-11-18 13:21:35,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-11-18 13:21:35,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-11-18 13:21:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-11-18 13:21:35,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 251 transitions. [2018-11-18 13:21:35,502 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 251 transitions. Word has length 19 [2018-11-18 13:21:35,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,502 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 251 transitions. [2018-11-18 13:21:35,502 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 251 transitions. [2018-11-18 13:21:35,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:21:35,503 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,504 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 13:21:35,504 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1253383511, now seen corresponding path program 1 times [2018-11-18 13:21:35,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,524 INFO L87 Difference]: Start difference. First operand 169 states and 251 transitions. Second operand 3 states. [2018-11-18 13:21:35,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,547 INFO L93 Difference]: Finished difference Result 253 states and 373 transitions. [2018-11-18 13:21:35,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 13:21:35,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,548 INFO L225 Difference]: With dead ends: 253 [2018-11-18 13:21:35,548 INFO L226 Difference]: Without dead ends: 175 [2018-11-18 13:21:35,549 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-11-18 13:21:35,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-11-18 13:21:35,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-18 13:21:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 251 transitions. [2018-11-18 13:21:35,556 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 251 transitions. Word has length 20 [2018-11-18 13:21:35,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,557 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 251 transitions. [2018-11-18 13:21:35,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,557 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 251 transitions. [2018-11-18 13:21:35,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:21:35,558 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,558 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] [2018-11-18 13:21:35,558 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1646410521, now seen corresponding path program 1 times [2018-11-18 13:21:35,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,583 INFO L87 Difference]: Start difference. First operand 173 states and 251 transitions. Second operand 3 states. [2018-11-18 13:21:35,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,601 INFO L93 Difference]: Finished difference Result 301 states and 441 transitions. [2018-11-18 13:21:35,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 13:21:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,603 INFO L225 Difference]: With dead ends: 301 [2018-11-18 13:21:35,603 INFO L226 Difference]: Without dead ends: 299 [2018-11-18 13:21:35,603 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-18 13:21:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 241. [2018-11-18 13:21:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-11-18 13:21:35,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 343 transitions. [2018-11-18 13:21:35,612 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 343 transitions. Word has length 20 [2018-11-18 13:21:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,613 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 343 transitions. [2018-11-18 13:21:35,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 343 transitions. [2018-11-18 13:21:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 13:21:35,614 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,614 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] [2018-11-18 13:21:35,614 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash -966352151, now seen corresponding path program 1 times [2018-11-18 13:21:35,615 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,634 INFO L87 Difference]: Start difference. First operand 241 states and 343 transitions. Second operand 3 states. [2018-11-18 13:21:35,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,654 INFO L93 Difference]: Finished difference Result 549 states and 777 transitions. [2018-11-18 13:21:35,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-18 13:21:35,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,656 INFO L225 Difference]: With dead ends: 549 [2018-11-18 13:21:35,656 INFO L226 Difference]: Without dead ends: 323 [2018-11-18 13:21:35,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-11-18 13:21:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-11-18 13:21:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-11-18 13:21:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 439 transitions. [2018-11-18 13:21:35,669 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 439 transitions. Word has length 20 [2018-11-18 13:21:35,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,669 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 439 transitions. [2018-11-18 13:21:35,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,669 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 439 transitions. [2018-11-18 13:21:35,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 13:21:35,670 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,670 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] [2018-11-18 13:21:35,670 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,671 INFO L82 PathProgramCache]: Analyzing trace with hash 501097101, now seen corresponding path program 1 times [2018-11-18 13:21:35,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,694 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,695 INFO L87 Difference]: Start difference. First operand 321 states and 439 transitions. Second operand 3 states. [2018-11-18 13:21:35,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,718 INFO L93 Difference]: Finished difference Result 481 states and 653 transitions. [2018-11-18 13:21:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 13:21:35,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,719 INFO L225 Difference]: With dead ends: 481 [2018-11-18 13:21:35,719 INFO L226 Difference]: Without dead ends: 331 [2018-11-18 13:21:35,719 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-11-18 13:21:35,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-11-18 13:21:35,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-11-18 13:21:35,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 439 transitions. [2018-11-18 13:21:35,729 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 439 transitions. Word has length 21 [2018-11-18 13:21:35,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,729 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 439 transitions. [2018-11-18 13:21:35,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 439 transitions. [2018-11-18 13:21:35,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 13:21:35,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,730 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] [2018-11-18 13:21:35,730 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,731 INFO L82 PathProgramCache]: Analyzing trace with hash 108070091, now seen corresponding path program 1 times [2018-11-18 13:21:35,731 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,732 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,746 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,746 INFO L87 Difference]: Start difference. First operand 329 states and 439 transitions. Second operand 3 states. [2018-11-18 13:21:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,763 INFO L93 Difference]: Finished difference Result 925 states and 1209 transitions. [2018-11-18 13:21:35,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 13:21:35,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,765 INFO L225 Difference]: With dead ends: 925 [2018-11-18 13:21:35,765 INFO L226 Difference]: Without dead ends: 619 [2018-11-18 13:21:35,765 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2018-11-18 13:21:35,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 617. [2018-11-18 13:21:35,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 13:21:35,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 775 transitions. [2018-11-18 13:21:35,778 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 775 transitions. Word has length 21 [2018-11-18 13:21:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,778 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 775 transitions. [2018-11-18 13:21:35,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,778 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 775 transitions. [2018-11-18 13:21:35,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 13:21:35,779 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,779 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] [2018-11-18 13:21:35,780 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,780 INFO L82 PathProgramCache]: Analyzing trace with hash -571988279, now seen corresponding path program 1 times [2018-11-18 13:21:35,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,806 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,806 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,807 INFO L87 Difference]: Start difference. First operand 617 states and 775 transitions. Second operand 3 states. [2018-11-18 13:21:35,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,831 INFO L93 Difference]: Finished difference Result 701 states and 889 transitions. [2018-11-18 13:21:35,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,831 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 13:21:35,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,833 INFO L225 Difference]: With dead ends: 701 [2018-11-18 13:21:35,833 INFO L226 Difference]: Without dead ends: 699 [2018-11-18 13:21:35,833 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2018-11-18 13:21:35,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 617. [2018-11-18 13:21:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 617 states. [2018-11-18 13:21:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 759 transitions. [2018-11-18 13:21:35,847 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 759 transitions. Word has length 21 [2018-11-18 13:21:35,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,847 INFO L480 AbstractCegarLoop]: Abstraction has 617 states and 759 transitions. [2018-11-18 13:21:35,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 759 transitions. [2018-11-18 13:21:35,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 13:21:35,849 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,849 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-11-18 13:21:35,849 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,849 INFO L82 PathProgramCache]: Analyzing trace with hash -944578434, now seen corresponding path program 1 times [2018-11-18 13:21:35,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,867 INFO L87 Difference]: Start difference. First operand 617 states and 759 transitions. Second operand 3 states. [2018-11-18 13:21:35,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,892 INFO L93 Difference]: Finished difference Result 1019 states and 1240 transitions. [2018-11-18 13:21:35,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 13:21:35,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,895 INFO L225 Difference]: With dead ends: 1019 [2018-11-18 13:21:35,895 INFO L226 Difference]: Without dead ends: 1017 [2018-11-18 13:21:35,895 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1017 states. [2018-11-18 13:21:35,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1017 to 921. [2018-11-18 13:21:35,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 921 states. [2018-11-18 13:21:35,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1111 transitions. [2018-11-18 13:21:35,913 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1111 transitions. Word has length 22 [2018-11-18 13:21:35,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,914 INFO L480 AbstractCegarLoop]: Abstraction has 921 states and 1111 transitions. [2018-11-18 13:21:35,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,914 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1111 transitions. [2018-11-18 13:21:35,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 13:21:35,915 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 13:21:35,915 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-11-18 13:21:35,915 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 13:21:35,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 13:21:35,916 INFO L82 PathProgramCache]: Analyzing trace with hash -264520064, now seen corresponding path program 1 times [2018-11-18 13:21:35,916 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-18 13:21:35,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 13:21:35,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 13:21:35,917 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-18 13:21:35,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 13:21:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 13:21:35,938 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 13:21:35,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 13:21:35,938 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-18 13:21:35,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 13:21:35,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 13:21:35,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,939 INFO L87 Difference]: Start difference. First operand 921 states and 1111 transitions. Second operand 3 states. [2018-11-18 13:21:35,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 13:21:35,968 INFO L93 Difference]: Finished difference Result 2073 states and 2455 transitions. [2018-11-18 13:21:35,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 13:21:35,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-18 13:21:35,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 13:21:35,969 INFO L225 Difference]: With dead ends: 2073 [2018-11-18 13:21:35,969 INFO L226 Difference]: Without dead ends: 0 [2018-11-18 13:21:35,971 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 13:21:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-18 13:21:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-18 13:21:35,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-18 13:21:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-18 13:21:35,972 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-11-18 13:21:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 13:21:35,972 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 13:21:35,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 13:21:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-18 13:21:35,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 13:21:35,975 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-18 13:21:35,995 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-18 13:21:35,995 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:21:35,995 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-18 13:21:35,995 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-18 13:21:35,995 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-18 13:21:35,995 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-18 13:21:35,995 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 107) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L77-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L428 ceAbstractionStarter]: At program point L103(lines 5 107) the Hoare annotation is: true [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L62-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L46(lines 46 48) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 107) no Hoare annotation was computed. [2018-11-18 13:21:35,996 INFO L425 ceAbstractionStarter]: For program point L46-2(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,997 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 107) the Hoare annotation is: true [2018-11-18 13:21:35,997 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-18 13:21:35,997 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,997 INFO L428 ceAbstractionStarter]: At program point L97-1(lines 27 102) the Hoare annotation is: true [2018-11-18 13:21:35,997 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-18 13:21:35,997 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-18 13:21:35,997 INFO L425 ceAbstractionStarter]: For program point L98(line 98) no Hoare annotation was computed. [2018-11-18 13:21:35,997 INFO L421 ceAbstractionStarter]: At program point L98-1(lines 5 107) the Hoare annotation is: false [2018-11-18 13:21:35,997 INFO L425 ceAbstractionStarter]: For program point L82-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,997 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,998 INFO L425 ceAbstractionStarter]: For program point L58-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,998 INFO L425 ceAbstractionStarter]: For program point L83(line 83) no Hoare annotation was computed. [2018-11-18 13:21:35,998 INFO L425 ceAbstractionStarter]: For program point L50-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:35,998 INFO L425 ceAbstractionStarter]: For program point L92-1(lines 27 102) no Hoare annotation was computed. [2018-11-18 13:21:36,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 01:21:36 BoogieIcfgContainer [2018-11-18 13:21:36,003 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-18 13:21:36,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 13:21:36,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 13:21:36,003 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 13:21:36,004 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 01:21:34" (3/4) ... [2018-11-18 13:21:36,009 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-18 13:21:36,013 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-18 13:21:36,013 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-18 13:21:36,017 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-18 13:21:36,017 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-11-18 13:21:36,017 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-18 13:21:36,054 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_68a92bde-c1f6-47a5-b00c-d8f96e129ded/bin-2019/utaipan/witness.graphml [2018-11-18 13:21:36,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 13:21:36,055 INFO L168 Benchmark]: Toolchain (without parser) took 1635.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 958.2 MB in the beginning and 917.2 MB in the end (delta: 40.9 MB). Peak memory consumption was 175.1 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:36,056 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:21:36,056 INFO L168 Benchmark]: CACSL2BoogieTranslator took 173.32 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:36,056 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.68 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:36,057 INFO L168 Benchmark]: Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 13:21:36,057 INFO L168 Benchmark]: RCFGBuilder took 201.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:36,057 INFO L168 Benchmark]: TraceAbstraction took 1180.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.8 MB in the end (delta: 191.6 MB). Peak memory consumption was 191.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:36,057 INFO L168 Benchmark]: Witness Printer took 51.27 ms. Allocated memory is still 1.2 GB. Free memory was 920.8 MB in the beginning and 917.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-18 13:21:36,059 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 173.32 ms. Allocated memory is still 1.0 GB. Free memory was 958.2 MB in the beginning and 947.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.68 ms. Allocated memory is still 1.0 GB. Free memory was 947.4 MB in the beginning and 944.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.95 ms. Allocated memory is still 1.0 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 201.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -167.7 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1180.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 920.8 MB in the end (delta: 191.6 MB). Peak memory consumption was 191.6 MB. Max. memory is 11.5 GB. * Witness Printer took 51.27 ms. Allocated memory is still 1.2 GB. Free memory was 920.8 MB in the beginning and 917.2 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 33 locations, 1 error locations. SAFE Result, 1.1s OverallTime, 16 OverallIterations, 1 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 907 SDtfs, 408 SDslu, 595 SDs, 0 SdLazy, 85 SolverSat, 16 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 331 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 74 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 312 NumberOfCodeBlocks, 312 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 9734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...