./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_9.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20a70402cc893fb2c7adec21ca8a267adc3c5cbb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-29 23:30:19,926 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:30:19,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:30:19,976 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:30:19,977 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:30:19,978 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:30:19,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:30:20,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:30:20,005 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:30:20,009 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:30:20,010 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:30:20,014 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:30:20,014 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:30:20,023 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:30:20,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:30:20,027 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:30:20,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:30:20,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:30:20,036 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:30:20,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:30:20,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:30:20,052 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:30:20,054 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:30:20,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:30:20,062 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:30:20,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:30:20,065 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:30:20,067 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:30:20,068 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:30:20,069 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:30:20,070 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:30:20,071 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:30:20,074 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:30:20,075 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:30:20,077 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:30:20,077 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:30:20,078 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:30:20,078 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:30:20,078 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:30:20,079 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:30:20,080 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:30:20,086 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 23:30:20,122 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:30:20,122 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:30:20,124 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:30:20,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:30:20,125 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:30:20,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:30:20,125 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:30:20,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:30:20,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:30:20,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:30:20,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 23:30:20,128 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:30:20,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 23:30:20,128 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:30:20,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:30:20,129 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:30:20,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 23:30:20,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:30:20,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:30:20,130 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:30:20,130 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:30:20,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:30:20,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:30:20,131 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:30:20,131 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 23:30:20,131 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:30:20,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 23:30:20,132 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 23:30:20,132 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:30:20,132 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer 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(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer 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 -> 20a70402cc893fb2c7adec21ca8a267adc3c5cbb [2020-11-29 23:30:20,494 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:30:20,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:30:20,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:30:20,533 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:30:20,534 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:30:20,535 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_9.c [2020-11-29 23:30:20,625 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/data/fd14b7b32/77e19df1421040018c4f8557bb3048fb/FLAG105ef49f0 [2020-11-29 23:30:21,215 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:30:21,217 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/sv-benchmarks/c/locks/test_locks_9.c [2020-11-29 23:30:21,228 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/data/fd14b7b32/77e19df1421040018c4f8557bb3048fb/FLAG105ef49f0 [2020-11-29 23:30:21,560 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/data/fd14b7b32/77e19df1421040018c4f8557bb3048fb [2020-11-29 23:30:21,563 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:30:21,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:30:21,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:30:21,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:30:21,574 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:30:21,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,580 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66408ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21, skipping insertion in model container [2020-11-29 23:30:21,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:30:21,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:30:21,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:30:21,839 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:30:21,867 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:30:21,883 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:30:21,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21 WrapperNode [2020-11-29 23:30:21,884 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:30:21,885 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:30:21,885 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:30:21,885 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:30:21,894 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,902 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,925 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:30:21,926 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:30:21,926 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:30:21,926 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:30:21,935 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,935 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,937 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,937 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,948 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... [2020-11-29 23:30:21,953 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:30:21,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:30:21,954 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:30:21,954 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:30:21,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/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 [2020-11-29 23:30:22,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:30:22,026 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:30:22,026 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:30:22,026 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:30:22,464 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:30:22,465 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-11-29 23:30:22,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:30:22 BoogieIcfgContainer [2020-11-29 23:30:22,467 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:30:22,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:30:22,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:30:22,473 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:30:22,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:30:21" (1/3) ... [2020-11-29 23:30:22,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9c7dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:30:22, skipping insertion in model container [2020-11-29 23:30:22,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:30:21" (2/3) ... [2020-11-29 23:30:22,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a9c7dc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:30:22, skipping insertion in model container [2020-11-29 23:30:22,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:30:22" (3/3) ... [2020-11-29 23:30:22,477 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2020-11-29 23:30:22,489 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:30:22,494 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-29 23:30:22,507 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-29 23:30:22,532 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:30:22,532 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 23:30:22,532 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:30:22,532 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:30:22,532 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:30:22,533 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:30:22,533 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:30:22,533 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:30:22,547 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-11-29 23:30:22,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 23:30:22,553 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:22,554 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:22,554 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:22,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2020-11-29 23:30:22,566 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:22,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678000008] [2020-11-29 23:30:22,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:22,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:22,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678000008] [2020-11-29 23:30:22,774 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:22,774 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:22,775 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392365290] [2020-11-29 23:30:22,780 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:22,780 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:22,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:22,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:22,799 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-11-29 23:30:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:22,866 INFO L93 Difference]: Finished difference Result 78 states and 134 transitions. [2020-11-29 23:30:22,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:22,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-11-29 23:30:22,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:22,895 INFO L225 Difference]: With dead ends: 78 [2020-11-29 23:30:22,903 INFO L226 Difference]: Without dead ends: 63 [2020-11-29 23:30:22,906 INFO L677 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 [2020-11-29 23:30:22,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-29 23:30:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2020-11-29 23:30:22,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-11-29 23:30:22,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2020-11-29 23:30:22,963 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2020-11-29 23:30:22,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:22,963 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2020-11-29 23:30:22,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2020-11-29 23:30:22,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-11-29 23:30:22,967 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:22,967 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:22,967 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 23:30:22,967 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:22,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:22,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2020-11-29 23:30:22,970 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:22,971 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062565926] [2020-11-29 23:30:22,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062565926] [2020-11-29 23:30:23,091 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165600116] [2020-11-29 23:30:23,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,094 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand 3 states. [2020-11-29 23:30:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:23,145 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2020-11-29 23:30:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:23,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-11-29 23:30:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:23,149 INFO L225 Difference]: With dead ends: 104 [2020-11-29 23:30:23,149 INFO L226 Difference]: Without dead ends: 63 [2020-11-29 23:30:23,150 INFO L677 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 [2020-11-29 23:30:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-11-29 23:30:23,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-11-29 23:30:23,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-11-29 23:30:23,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2020-11-29 23:30:23,167 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2020-11-29 23:30:23,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:23,169 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2020-11-29 23:30:23,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:23,169 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2020-11-29 23:30:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 23:30:23,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:23,173 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:23,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 23:30:23,175 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:23,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:23,176 INFO L82 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2020-11-29 23:30:23,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:23,177 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638590448] [2020-11-29 23:30:23,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,280 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638590448] [2020-11-29 23:30:23,280 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,281 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192875675] [2020-11-29 23:30:23,292 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,293 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand 3 states. [2020-11-29 23:30:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:23,330 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2020-11-29 23:30:23,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:23,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-29 23:30:23,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:23,335 INFO L225 Difference]: With dead ends: 96 [2020-11-29 23:30:23,336 INFO L226 Difference]: Without dead ends: 66 [2020-11-29 23:30:23,336 INFO L677 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 [2020-11-29 23:30:23,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-11-29 23:30:23,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-11-29 23:30:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-11-29 23:30:23,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2020-11-29 23:30:23,348 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2020-11-29 23:30:23,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:23,349 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2020-11-29 23:30:23,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:23,349 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2020-11-29 23:30:23,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 23:30:23,350 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:23,350 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:23,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 23:30:23,351 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:23,351 INFO L82 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2020-11-29 23:30:23,352 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:23,352 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679790053] [2020-11-29 23:30:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,437 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679790053] [2020-11-29 23:30:23,437 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,438 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,438 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558642514] [2020-11-29 23:30:23,438 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,438 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,440 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand 3 states. [2020-11-29 23:30:23,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:23,479 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2020-11-29 23:30:23,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:23,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-29 23:30:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:23,482 INFO L225 Difference]: With dead ends: 121 [2020-11-29 23:30:23,482 INFO L226 Difference]: Without dead ends: 119 [2020-11-29 23:30:23,483 INFO L677 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 [2020-11-29 23:30:23,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-11-29 23:30:23,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2020-11-29 23:30:23,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-11-29 23:30:23,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2020-11-29 23:30:23,503 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2020-11-29 23:30:23,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:23,504 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2020-11-29 23:30:23,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:23,504 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2020-11-29 23:30:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-11-29 23:30:23,505 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:23,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:23,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 23:30:23,506 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:23,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:23,507 INFO L82 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2020-11-29 23:30:23,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:23,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494433581] [2020-11-29 23:30:23,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,546 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494433581] [2020-11-29 23:30:23,546 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,547 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,547 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406964915] [2020-11-29 23:30:23,547 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,548 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,549 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand 3 states. [2020-11-29 23:30:23,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:23,571 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2020-11-29 23:30:23,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:23,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-11-29 23:30:23,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:23,573 INFO L225 Difference]: With dead ends: 201 [2020-11-29 23:30:23,573 INFO L226 Difference]: Without dead ends: 121 [2020-11-29 23:30:23,574 INFO L677 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 [2020-11-29 23:30:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-11-29 23:30:23,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2020-11-29 23:30:23,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-11-29 23:30:23,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2020-11-29 23:30:23,593 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2020-11-29 23:30:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:23,593 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2020-11-29 23:30:23,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2020-11-29 23:30:23,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 23:30:23,596 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:23,596 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:23,596 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 23:30:23,596 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2020-11-29 23:30:23,597 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:23,598 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210320138] [2020-11-29 23:30:23,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210320138] [2020-11-29 23:30:23,657 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,657 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433439885] [2020-11-29 23:30:23,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,658 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,659 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand 3 states. [2020-11-29 23:30:23,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:23,676 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2020-11-29 23:30:23,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:23,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-29 23:30:23,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:23,678 INFO L225 Difference]: With dead ends: 180 [2020-11-29 23:30:23,678 INFO L226 Difference]: Without dead ends: 123 [2020-11-29 23:30:23,679 INFO L677 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 [2020-11-29 23:30:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-11-29 23:30:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2020-11-29 23:30:23,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-11-29 23:30:23,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2020-11-29 23:30:23,688 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2020-11-29 23:30:23,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:23,688 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2020-11-29 23:30:23,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:23,688 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2020-11-29 23:30:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 23:30:23,690 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:23,690 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:23,690 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 23:30:23,690 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:23,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:23,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2020-11-29 23:30:23,691 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:23,691 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216999474] [2020-11-29 23:30:23,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,733 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216999474] [2020-11-29 23:30:23,733 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,733 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,733 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482313415] [2020-11-29 23:30:23,734 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,735 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand 3 states. [2020-11-29 23:30:23,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:23,768 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2020-11-29 23:30:23,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:23,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-29 23:30:23,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:23,771 INFO L225 Difference]: With dead ends: 345 [2020-11-29 23:30:23,771 INFO L226 Difference]: Without dead ends: 231 [2020-11-29 23:30:23,772 INFO L677 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 [2020-11-29 23:30:23,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-11-29 23:30:23,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2020-11-29 23:30:23,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-11-29 23:30:23,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2020-11-29 23:30:23,806 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2020-11-29 23:30:23,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:23,806 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2020-11-29 23:30:23,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:23,807 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2020-11-29 23:30:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 23:30:23,808 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:23,808 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:23,809 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 23:30:23,809 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:23,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:23,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2020-11-29 23:30:23,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:23,810 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061040632] [2020-11-29 23:30:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,867 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061040632] [2020-11-29 23:30:23,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441810988] [2020-11-29 23:30:23,868 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,869 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand 3 states. [2020-11-29 23:30:23,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:23,903 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2020-11-29 23:30:23,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:23,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-11-29 23:30:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:23,908 INFO L225 Difference]: With dead ends: 289 [2020-11-29 23:30:23,909 INFO L226 Difference]: Without dead ends: 287 [2020-11-29 23:30:23,909 INFO L677 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 [2020-11-29 23:30:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-11-29 23:30:23,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2020-11-29 23:30:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-11-29 23:30:23,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2020-11-29 23:30:23,933 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2020-11-29 23:30:23,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:23,934 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2020-11-29 23:30:23,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:23,934 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2020-11-29 23:30:23,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-29 23:30:23,936 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:23,936 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:23,936 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 23:30:23,936 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:23,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:23,937 INFO L82 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2020-11-29 23:30:23,937 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:23,937 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156894976] [2020-11-29 23:30:23,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:23,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:23,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156894976] [2020-11-29 23:30:23,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:23,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:23,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841030339] [2020-11-29 23:30:23,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:23,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:23,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:23,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:23,994 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand 3 states. [2020-11-29 23:30:24,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,026 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2020-11-29 23:30:24,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-11-29 23:30:24,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,030 INFO L225 Difference]: With dead ends: 421 [2020-11-29 23:30:24,031 INFO L226 Difference]: Without dead ends: 419 [2020-11-29 23:30:24,031 INFO L677 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 [2020-11-29 23:30:24,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2020-11-29 23:30:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2020-11-29 23:30:24,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-11-29 23:30:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2020-11-29 23:30:24,059 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2020-11-29 23:30:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,059 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2020-11-29 23:30:24,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,059 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2020-11-29 23:30:24,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-11-29 23:30:24,068 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,068 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:24,068 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 23:30:24,068 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,069 INFO L82 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2020-11-29 23:30:24,069 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,069 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387241218] [2020-11-29 23:30:24,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,118 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387241218] [2020-11-29 23:30:24,118 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,118 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,118 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522428477] [2020-11-29 23:30:24,118 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,119 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,119 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand 3 states. [2020-11-29 23:30:24,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,155 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2020-11-29 23:30:24,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-11-29 23:30:24,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,159 INFO L225 Difference]: With dead ends: 757 [2020-11-29 23:30:24,159 INFO L226 Difference]: Without dead ends: 443 [2020-11-29 23:30:24,161 INFO L677 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 [2020-11-29 23:30:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2020-11-29 23:30:24,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2020-11-29 23:30:24,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-11-29 23:30:24,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2020-11-29 23:30:24,207 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2020-11-29 23:30:24,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,208 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2020-11-29 23:30:24,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,208 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2020-11-29 23:30:24,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 23:30:24,209 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,209 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:24,209 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 23:30:24,210 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2020-11-29 23:30:24,211 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,211 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119676956] [2020-11-29 23:30:24,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,256 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119676956] [2020-11-29 23:30:24,256 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,256 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,256 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196992404] [2020-11-29 23:30:24,256 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,257 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand 3 states. [2020-11-29 23:30:24,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,289 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2020-11-29 23:30:24,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-11-29 23:30:24,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,293 INFO L225 Difference]: With dead ends: 669 [2020-11-29 23:30:24,294 INFO L226 Difference]: Without dead ends: 455 [2020-11-29 23:30:24,294 INFO L677 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 [2020-11-29 23:30:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-11-29 23:30:24,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2020-11-29 23:30:24,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-11-29 23:30:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2020-11-29 23:30:24,316 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2020-11-29 23:30:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,317 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2020-11-29 23:30:24,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2020-11-29 23:30:24,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 23:30:24,318 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,319 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:24,319 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 23:30:24,319 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2020-11-29 23:30:24,320 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,321 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67919392] [2020-11-29 23:30:24,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,370 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67919392] [2020-11-29 23:30:24,370 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,370 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,370 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320101312] [2020-11-29 23:30:24,371 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,371 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,372 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand 3 states. [2020-11-29 23:30:24,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,401 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2020-11-29 23:30:24,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-11-29 23:30:24,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,407 INFO L225 Difference]: With dead ends: 809 [2020-11-29 23:30:24,407 INFO L226 Difference]: Without dead ends: 807 [2020-11-29 23:30:24,408 INFO L677 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 [2020-11-29 23:30:24,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-11-29 23:30:24,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2020-11-29 23:30:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-11-29 23:30:24,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2020-11-29 23:30:24,430 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2020-11-29 23:30:24,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,430 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2020-11-29 23:30:24,430 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2020-11-29 23:30:24,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-11-29 23:30:24,432 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,432 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:24,432 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 23:30:24,436 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2020-11-29 23:30:24,437 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844896049] [2020-11-29 23:30:24,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844896049] [2020-11-29 23:30:24,472 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907790286] [2020-11-29 23:30:24,473 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,474 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand 3 states. [2020-11-29 23:30:24,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,511 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2020-11-29 23:30:24,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,512 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-11-29 23:30:24,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,521 INFO L225 Difference]: With dead ends: 1497 [2020-11-29 23:30:24,521 INFO L226 Difference]: Without dead ends: 871 [2020-11-29 23:30:24,522 INFO L677 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 [2020-11-29 23:30:24,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2020-11-29 23:30:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2020-11-29 23:30:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2020-11-29 23:30:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2020-11-29 23:30:24,553 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2020-11-29 23:30:24,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,553 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2020-11-29 23:30:24,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2020-11-29 23:30:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:30:24,555 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:24,556 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 23:30:24,556 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2020-11-29 23:30:24,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788301784] [2020-11-29 23:30:24,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788301784] [2020-11-29 23:30:24,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741212133] [2020-11-29 23:30:24,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,596 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,596 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand 3 states. [2020-11-29 23:30:24,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,626 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2020-11-29 23:30:24,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-29 23:30:24,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,633 INFO L225 Difference]: With dead ends: 1305 [2020-11-29 23:30:24,634 INFO L226 Difference]: Without dead ends: 887 [2020-11-29 23:30:24,637 INFO L677 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 [2020-11-29 23:30:24,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-11-29 23:30:24,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2020-11-29 23:30:24,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-11-29 23:30:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2020-11-29 23:30:24,669 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2020-11-29 23:30:24,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,669 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2020-11-29 23:30:24,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,669 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2020-11-29 23:30:24,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:30:24,671 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,671 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:24,672 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 23:30:24,672 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,672 INFO L82 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2020-11-29 23:30:24,673 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,673 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533900349] [2020-11-29 23:30:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,707 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533900349] [2020-11-29 23:30:24,707 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,707 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,708 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308522897] [2020-11-29 23:30:24,708 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,708 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,709 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand 3 states. [2020-11-29 23:30:24,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,743 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2020-11-29 23:30:24,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-29 23:30:24,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,753 INFO L225 Difference]: With dead ends: 1545 [2020-11-29 23:30:24,753 INFO L226 Difference]: Without dead ends: 1543 [2020-11-29 23:30:24,756 INFO L677 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 [2020-11-29 23:30:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2020-11-29 23:30:24,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2020-11-29 23:30:24,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1285 states. [2020-11-29 23:30:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2020-11-29 23:30:24,800 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2020-11-29 23:30:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,800 INFO L481 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2020-11-29 23:30:24,800 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2020-11-29 23:30:24,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:30:24,810 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,810 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:24,810 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 23:30:24,810 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2020-11-29 23:30:24,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,811 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868584479] [2020-11-29 23:30:24,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,839 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868584479] [2020-11-29 23:30:24,839 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,839 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,840 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345996451] [2020-11-29 23:30:24,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,840 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,841 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand 3 states. [2020-11-29 23:30:24,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:24,887 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2020-11-29 23:30:24,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:24,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-29 23:30:24,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:24,897 INFO L225 Difference]: With dead ends: 2953 [2020-11-29 23:30:24,897 INFO L226 Difference]: Without dead ends: 1703 [2020-11-29 23:30:24,899 INFO L677 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 [2020-11-29 23:30:24,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2020-11-29 23:30:24,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2020-11-29 23:30:24,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2020-11-29 23:30:24,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2020-11-29 23:30:24,967 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2020-11-29 23:30:24,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:24,969 INFO L481 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2020-11-29 23:30:24,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:24,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2020-11-29 23:30:24,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 23:30:24,971 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:24,971 INFO L422 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] [2020-11-29 23:30:24,971 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 23:30:24,971 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:24,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:24,972 INFO L82 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2020-11-29 23:30:24,972 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:24,972 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887196908] [2020-11-29 23:30:24,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:24,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:24,995 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887196908] [2020-11-29 23:30:24,996 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:24,996 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:24,996 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906398844] [2020-11-29 23:30:24,996 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:24,996 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:24,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:24,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:24,997 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand 3 states. [2020-11-29 23:30:25,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:25,045 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2020-11-29 23:30:25,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:25,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-29 23:30:25,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:25,055 INFO L225 Difference]: With dead ends: 2553 [2020-11-29 23:30:25,055 INFO L226 Difference]: Without dead ends: 1735 [2020-11-29 23:30:25,060 INFO L677 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 [2020-11-29 23:30:25,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2020-11-29 23:30:25,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2020-11-29 23:30:25,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-11-29 23:30:25,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2020-11-29 23:30:25,122 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2020-11-29 23:30:25,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:25,122 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2020-11-29 23:30:25,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:25,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2020-11-29 23:30:25,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 23:30:25,126 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:25,126 INFO L422 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] [2020-11-29 23:30:25,126 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 23:30:25,126 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:25,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:25,127 INFO L82 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2020-11-29 23:30:25,127 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:25,127 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828437062] [2020-11-29 23:30:25,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:25,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:25,146 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828437062] [2020-11-29 23:30:25,146 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:25,146 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:25,146 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481168539] [2020-11-29 23:30:25,146 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:25,147 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:25,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:25,147 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand 3 states. [2020-11-29 23:30:25,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:25,208 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2020-11-29 23:30:25,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:25,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-29 23:30:25,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:25,225 INFO L225 Difference]: With dead ends: 2953 [2020-11-29 23:30:25,225 INFO L226 Difference]: Without dead ends: 2951 [2020-11-29 23:30:25,227 INFO L677 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 [2020-11-29 23:30:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-11-29 23:30:25,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2020-11-29 23:30:25,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2020-11-29 23:30:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2020-11-29 23:30:25,325 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2020-11-29 23:30:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:25,325 INFO L481 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2020-11-29 23:30:25,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2020-11-29 23:30:25,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-29 23:30:25,329 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:25,329 INFO L422 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] [2020-11-29 23:30:25,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 23:30:25,329 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:25,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:25,331 INFO L82 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2020-11-29 23:30:25,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:25,333 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491053193] [2020-11-29 23:30:25,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:25,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:25,366 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491053193] [2020-11-29 23:30:25,366 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:25,366 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:25,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101081141] [2020-11-29 23:30:25,367 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:25,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:25,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:25,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:25,368 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand 3 states. [2020-11-29 23:30:25,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:25,447 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2020-11-29 23:30:25,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:25,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-11-29 23:30:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:25,464 INFO L225 Difference]: With dead ends: 5833 [2020-11-29 23:30:25,464 INFO L226 Difference]: Without dead ends: 3335 [2020-11-29 23:30:25,468 INFO L677 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 [2020-11-29 23:30:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2020-11-29 23:30:25,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2020-11-29 23:30:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2020-11-29 23:30:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2020-11-29 23:30:25,583 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2020-11-29 23:30:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:25,583 INFO L481 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2020-11-29 23:30:25,583 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2020-11-29 23:30:25,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 23:30:25,588 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:25,588 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:25,588 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 23:30:25,589 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:25,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:25,589 INFO L82 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2020-11-29 23:30:25,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:25,589 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331454568] [2020-11-29 23:30:25,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:25,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:25,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:25,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331454568] [2020-11-29 23:30:25,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:25,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:25,623 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826739637] [2020-11-29 23:30:25,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:25,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:25,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:25,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:25,624 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand 3 states. [2020-11-29 23:30:25,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:25,715 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2020-11-29 23:30:25,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:25,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-29 23:30:25,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:25,733 INFO L225 Difference]: With dead ends: 5001 [2020-11-29 23:30:25,733 INFO L226 Difference]: Without dead ends: 3399 [2020-11-29 23:30:25,736 INFO L677 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 [2020-11-29 23:30:25,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2020-11-29 23:30:25,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2020-11-29 23:30:25,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3397 states. [2020-11-29 23:30:25,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2020-11-29 23:30:25,861 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2020-11-29 23:30:25,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:25,862 INFO L481 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2020-11-29 23:30:25,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:25,862 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2020-11-29 23:30:25,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 23:30:25,866 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:25,866 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:25,867 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-29 23:30:25,867 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:25,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:25,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2020-11-29 23:30:25,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:25,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180935966] [2020-11-29 23:30:25,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:25,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180935966] [2020-11-29 23:30:25,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:25,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:25,893 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793021547] [2020-11-29 23:30:25,893 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:25,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:25,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:25,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:25,894 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand 3 states. [2020-11-29 23:30:25,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:25,987 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2020-11-29 23:30:25,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:25,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-29 23:30:25,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:26,040 INFO L225 Difference]: With dead ends: 5641 [2020-11-29 23:30:26,040 INFO L226 Difference]: Without dead ends: 5639 [2020-11-29 23:30:26,042 INFO L677 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 [2020-11-29 23:30:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2020-11-29 23:30:26,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2020-11-29 23:30:26,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5125 states. [2020-11-29 23:30:26,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2020-11-29 23:30:26,205 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2020-11-29 23:30:26,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:26,205 INFO L481 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2020-11-29 23:30:26,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:26,206 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2020-11-29 23:30:26,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-11-29 23:30:26,218 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:26,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:26,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-29 23:30:26,218 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:26,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:26,219 INFO L82 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2020-11-29 23:30:26,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:26,219 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929261097] [2020-11-29 23:30:26,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:26,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:26,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929261097] [2020-11-29 23:30:26,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:26,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:26,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640936314] [2020-11-29 23:30:26,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:26,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:26,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:26,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:26,242 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand 3 states. [2020-11-29 23:30:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:26,365 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2020-11-29 23:30:26,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:26,366 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-11-29 23:30:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:26,379 INFO L225 Difference]: With dead ends: 11529 [2020-11-29 23:30:26,380 INFO L226 Difference]: Without dead ends: 6535 [2020-11-29 23:30:26,388 INFO L677 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 [2020-11-29 23:30:26,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2020-11-29 23:30:26,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2020-11-29 23:30:26,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6533 states. [2020-11-29 23:30:26,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2020-11-29 23:30:26,604 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2020-11-29 23:30:26,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:26,605 INFO L481 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2020-11-29 23:30:26,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2020-11-29 23:30:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 23:30:26,614 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:26,614 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:26,615 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-29 23:30:26,615 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:26,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:26,615 INFO L82 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2020-11-29 23:30:26,615 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:26,616 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526838891] [2020-11-29 23:30:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:26,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:26,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526838891] [2020-11-29 23:30:26,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:26,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:26,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434579988] [2020-11-29 23:30:26,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:26,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:26,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:26,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:26,647 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand 3 states. [2020-11-29 23:30:26,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:26,760 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2020-11-29 23:30:26,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:26,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-29 23:30:26,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:26,774 INFO L225 Difference]: With dead ends: 9801 [2020-11-29 23:30:26,774 INFO L226 Difference]: Without dead ends: 6663 [2020-11-29 23:30:26,779 INFO L677 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 [2020-11-29 23:30:26,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2020-11-29 23:30:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2020-11-29 23:30:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2020-11-29 23:30:26,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2020-11-29 23:30:26,999 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2020-11-29 23:30:27,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:27,000 INFO L481 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2020-11-29 23:30:27,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:27,000 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2020-11-29 23:30:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 23:30:27,009 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:27,009 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:27,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-29 23:30:27,009 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:27,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2020-11-29 23:30:27,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:27,010 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953728249] [2020-11-29 23:30:27,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:27,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:27,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953728249] [2020-11-29 23:30:27,040 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:27,040 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:27,040 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920439135] [2020-11-29 23:30:27,041 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:27,041 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:27,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:27,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:27,041 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand 3 states. [2020-11-29 23:30:27,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:27,244 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2020-11-29 23:30:27,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:27,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-29 23:30:27,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:27,269 INFO L225 Difference]: With dead ends: 10759 [2020-11-29 23:30:27,270 INFO L226 Difference]: Without dead ends: 10757 [2020-11-29 23:30:27,273 INFO L677 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 [2020-11-29 23:30:27,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2020-11-29 23:30:27,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2020-11-29 23:30:27,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2020-11-29 23:30:27,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2020-11-29 23:30:27,570 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2020-11-29 23:30:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:27,570 INFO L481 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2020-11-29 23:30:27,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:27,570 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2020-11-29 23:30:27,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-11-29 23:30:27,585 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:30:27,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:30:27,586 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-29 23:30:27,586 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:30:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:30:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2020-11-29 23:30:27,587 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:30:27,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175024862] [2020-11-29 23:30:27,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:30:27,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:30:27,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:30:27,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175024862] [2020-11-29 23:30:27,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:30:27,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:30:27,633 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357718994] [2020-11-29 23:30:27,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:30:27,634 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:30:27,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:30:27,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:30:27,634 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand 3 states. [2020-11-29 23:30:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:30:27,809 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2020-11-29 23:30:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:30:27,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-11-29 23:30:27,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:30:27,810 INFO L225 Difference]: With dead ends: 22789 [2020-11-29 23:30:27,811 INFO L226 Difference]: Without dead ends: 0 [2020-11-29 23:30:27,834 INFO L677 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 [2020-11-29 23:30:27,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-29 23:30:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-29 23:30:27,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-29 23:30:27,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-29 23:30:27,835 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-11-29 23:30:27,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:30:27,836 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-29 23:30:27,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:30:27,836 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-29 23:30:27,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-29 23:30:27,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-29 23:30:27,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-29 23:30:27,856 INFO L274 CegarLoopResult]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,856 INFO L274 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2020-11-29 23:30:27,856 INFO L274 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-11-29 23:30:27,856 INFO L274 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2020-11-29 23:30:27,856 INFO L274 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L63(lines 63 65) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,857 INFO L274 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L277 CegarLoopResult]: At program point L147(lines 7 151) the Hoare annotation is: true [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-29 23:30:27,858 INFO L274 CegarLoopResult]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,859 INFO L274 CegarLoopResult]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,859 INFO L274 CegarLoopResult]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,859 INFO L277 CegarLoopResult]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2020-11-29 23:30:27,859 INFO L274 CegarLoopResult]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,859 INFO L274 CegarLoopResult]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,859 INFO L277 CegarLoopResult]: At program point L150(lines 6 151) the Hoare annotation is: true [2020-11-29 23:30:27,859 INFO L274 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2020-11-29 23:30:27,859 INFO L274 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2020-11-29 23:30:27,859 INFO L270 CegarLoopResult]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2020-11-29 23:30:27,859 INFO L274 CegarLoopResult]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2020-11-29 23:30:27,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:30:27 BoogieIcfgContainer [2020-11-29 23:30:27,875 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 23:30:27,876 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:30:27,876 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:30:27,876 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:30:27,877 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:30:22" (3/4) ... [2020-11-29 23:30:27,880 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-11-29 23:30:27,897 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-11-29 23:30:27,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-11-29 23:30:27,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 23:30:27,898 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-11-29 23:30:27,975 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_698fe41e-9421-43af-a0f4-84b3047e32ce/bin/uautomizer/witness.graphml [2020-11-29 23:30:27,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:30:27,978 INFO L168 Benchmark]: Toolchain (without parser) took 6412.58 ms. Allocated memory was 115.3 MB in the beginning and 281.0 MB in the end (delta: 165.7 MB). Free memory was 80.1 MB in the beginning and 112.5 MB in the end (delta: -32.4 MB). Peak memory consumption was 132.2 MB. Max. memory is 16.1 GB. [2020-11-29 23:30:27,979 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 115.3 MB. Free memory was 88.9 MB in the beginning and 88.9 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:30:27,979 INFO L168 Benchmark]: CACSL2BoogieTranslator took 317.84 ms. Allocated memory is still 115.3 MB. Free memory was 79.8 MB in the beginning and 90.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-11-29 23:30:27,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.06 ms. Allocated memory is still 115.3 MB. Free memory was 90.3 MB in the beginning and 88.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:30:27,980 INFO L168 Benchmark]: Boogie Preprocessor took 27.36 ms. Allocated memory is still 115.3 MB. Free memory was 88.9 MB in the beginning and 87.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:30:27,981 INFO L168 Benchmark]: RCFGBuilder took 513.10 ms. Allocated memory is still 115.3 MB. Free memory was 87.4 MB in the beginning and 69.0 MB in the end (delta: 18.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-29 23:30:27,981 INFO L168 Benchmark]: TraceAbstraction took 5406.70 ms. Allocated memory was 115.3 MB in the beginning and 281.0 MB in the end (delta: 165.7 MB). Free memory was 68.5 MB in the beginning and 116.7 MB in the end (delta: -48.2 MB). Peak memory consumption was 118.0 MB. Max. memory is 16.1 GB. [2020-11-29 23:30:27,983 INFO L168 Benchmark]: Witness Printer took 100.00 ms. Allocated memory is still 281.0 MB. Free memory was 116.7 MB in the beginning and 112.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 23:30:27,985 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 115.3 MB. Free memory was 88.9 MB in the beginning and 88.9 MB in the end (delta: 27.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 317.84 ms. Allocated memory is still 115.3 MB. Free memory was 79.8 MB in the beginning and 90.3 MB in the end (delta: -10.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.06 ms. Allocated memory is still 115.3 MB. Free memory was 90.3 MB in the beginning and 88.9 MB in the end (delta: 1.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 27.36 ms. Allocated memory is still 115.3 MB. Free memory was 88.9 MB in the beginning and 87.4 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 513.10 ms. Allocated memory is still 115.3 MB. Free memory was 87.4 MB in the beginning and 69.0 MB in the end (delta: 18.3 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5406.70 ms. Allocated memory was 115.3 MB in the beginning and 281.0 MB in the end (delta: 165.7 MB). Free memory was 68.5 MB in the beginning and 116.7 MB in the end (delta: -48.2 MB). Peak memory consumption was 118.0 MB. Max. memory is 16.1 GB. * Witness Printer took 100.00 ms. Allocated memory is still 281.0 MB. Free memory was 116.7 MB in the beginning and 112.5 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.3s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1866 SDtfs, 922 SDslu, 1232 SDs, 0 SdLazy, 133 SolverSat, 25 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 19602 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...