./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 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_9.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/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-69874e2 [2020-12-01 15:27:46,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:27:46,486 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:27:46,543 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:27:46,544 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:27:46,553 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:27:46,556 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:27:46,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:27:46,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:27:46,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:27:46,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:27:46,575 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:27:46,576 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:27:46,576 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:27:46,577 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:27:46,579 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:27:46,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:27:46,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:27:46,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:27:46,585 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:27:46,590 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:27:46,591 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:27:46,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:27:46,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:27:46,606 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:27:46,606 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:27:46,607 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:27:46,608 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:27:46,609 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:27:46,610 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:27:46,610 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:27:46,612 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:27:46,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:27:46,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:27:46,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:27:46,616 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:27:46,616 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:27:46,617 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:27:46,617 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:27:46,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:27:46,618 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:27:46,620 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:27:46,660 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:27:46,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:27:46,662 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:27:46,662 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:27:46,662 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:27:46,662 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:27:46,663 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:27:46,663 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:27:46,663 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:27:46,663 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:27:46,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:27:46,664 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:27:46,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:27:46,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:27:46,665 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:27:46,665 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:27:46,665 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:27:46,666 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:27:46,666 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:27:46,666 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:27:46,666 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:27:46,666 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:27:46,667 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:27:46,667 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:27:46,667 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:27:46,667 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:27:46,667 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:27:46,668 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:27:46,668 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:27:46,668 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_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/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_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/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-12-01 15:27:46,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:27:46,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:27:46,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:27:46,948 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:27:46,951 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:27:46,953 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/../../sv-benchmarks/c/locks/test_locks_9.c [2020-12-01 15:27:47,039 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/data/973b22ada/b2f51fb258aa4fa8a5e491c965142c8d/FLAG322c6630a [2020-12-01 15:27:47,452 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:27:47,453 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/sv-benchmarks/c/locks/test_locks_9.c [2020-12-01 15:27:47,460 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/data/973b22ada/b2f51fb258aa4fa8a5e491c965142c8d/FLAG322c6630a [2020-12-01 15:27:47,860 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/data/973b22ada/b2f51fb258aa4fa8a5e491c965142c8d [2020-12-01 15:27:47,863 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:27:47,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:27:47,866 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:27:47,866 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:27:47,869 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:27:47,870 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:27:47" (1/1) ... [2020-12-01 15:27:47,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66eb1d13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:47, skipping insertion in model container [2020-12-01 15:27:47,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:27:47" (1/1) ... [2020-12-01 15:27:47,879 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:27:47,898 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:27:48,082 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:27:48,090 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:27:48,110 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:27:48,121 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:27:48,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48 WrapperNode [2020-12-01 15:27:48,122 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:27:48,123 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:27:48,123 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:27:48,123 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:27:48,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,136 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:27:48,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:27:48,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:27:48,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:27:48,166 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,168 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,168 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,173 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,178 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,180 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... [2020-12-01 15:27:48,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:27:48,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:27:48,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:27:48,183 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:27:48,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/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-12-01 15:27:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:27:48,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:27:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:27:48,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:27:48,541 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:27:48,541 INFO L298 CfgBuilder]: Removed 7 assume(true) statements. [2020-12-01 15:27:48,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:27:48 BoogieIcfgContainer [2020-12-01 15:27:48,543 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:27:48,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:27:48,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:27:48,549 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:27:48,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:27:47" (1/3) ... [2020-12-01 15:27:48,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732ab43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:27:48, skipping insertion in model container [2020-12-01 15:27:48,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:27:48" (2/3) ... [2020-12-01 15:27:48,551 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@732ab43e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:27:48, skipping insertion in model container [2020-12-01 15:27:48,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:27:48" (3/3) ... [2020-12-01 15:27:48,552 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2020-12-01 15:27:48,566 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:27:48,569 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-12-01 15:27:48,580 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-12-01 15:27:48,604 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:27:48,604 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:27:48,604 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:27:48,604 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:27:48,604 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:27:48,605 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:27:48,605 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:27:48,605 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:27:48,619 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-12-01 15:27:48,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-01 15:27:48,629 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:48,630 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:48,630 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:48,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:48,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2020-12-01 15:27:48,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:48,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881276161] [2020-12-01 15:27:48,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:48,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:48,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:48,927 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881276161] [2020-12-01 15:27:48,928 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:48,928 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:48,929 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628990061] [2020-12-01 15:27:48,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:48,934 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:48,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:48,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:48,954 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 3 states. [2020-12-01 15:27:49,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,022 INFO L93 Difference]: Finished difference Result 78 states and 134 transitions. [2020-12-01 15:27:49,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-01 15:27:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,046 INFO L225 Difference]: With dead ends: 78 [2020-12-01 15:27:49,047 INFO L226 Difference]: Without dead ends: 63 [2020-12-01 15:27:49,051 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-12-01 15:27:49,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-01 15:27:49,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2020-12-01 15:27:49,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-12-01 15:27:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2020-12-01 15:27:49,108 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2020-12-01 15:27:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,108 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2020-12-01 15:27:49,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,109 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2020-12-01 15:27:49,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-01 15:27:49,111 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,111 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:49,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:27:49,111 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2020-12-01 15:27:49,115 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,115 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295880299] [2020-12-01 15:27:49,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:49,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:49,221 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295880299] [2020-12-01 15:27:49,221 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:49,222 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:49,222 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713586183] [2020-12-01 15:27:49,223 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:49,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:49,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:49,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:49,224 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand 3 states. [2020-12-01 15:27:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,245 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2020-12-01 15:27:49,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-12-01 15:27:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,247 INFO L225 Difference]: With dead ends: 104 [2020-12-01 15:27:49,247 INFO L226 Difference]: Without dead ends: 63 [2020-12-01 15:27:49,248 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-12-01 15:27:49,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-12-01 15:27:49,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2020-12-01 15:27:49,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-12-01 15:27:49,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2020-12-01 15:27:49,255 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2020-12-01 15:27:49,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,256 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2020-12-01 15:27:49,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,256 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2020-12-01 15:27:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 15:27:49,257 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:49,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:27:49,258 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,258 INFO L82 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2020-12-01 15:27:49,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,259 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021109990] [2020-12-01 15:27:49,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:49,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:49,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021109990] [2020-12-01 15:27:49,324 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:49,324 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:49,325 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856908645] [2020-12-01 15:27:49,325 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:49,325 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:49,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:49,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:49,326 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand 3 states. [2020-12-01 15:27:49,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,350 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2020-12-01 15:27:49,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-12-01 15:27:49,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,352 INFO L225 Difference]: With dead ends: 96 [2020-12-01 15:27:49,352 INFO L226 Difference]: Without dead ends: 66 [2020-12-01 15:27:49,352 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-12-01 15:27:49,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2020-12-01 15:27:49,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2020-12-01 15:27:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-12-01 15:27:49,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2020-12-01 15:27:49,361 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2020-12-01 15:27:49,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,361 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2020-12-01 15:27:49,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,362 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2020-12-01 15:27:49,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 15:27:49,363 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,363 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:49,363 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:27:49,363 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,364 INFO L82 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2020-12-01 15:27:49,364 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,364 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990947886] [2020-12-01 15:27:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:49,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:49,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990947886] [2020-12-01 15:27:49,448 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:49,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:49,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578186599] [2020-12-01 15:27:49,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:49,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:49,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:49,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:49,450 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand 3 states. [2020-12-01 15:27:49,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,483 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2020-12-01 15:27:49,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-12-01 15:27:49,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,486 INFO L225 Difference]: With dead ends: 121 [2020-12-01 15:27:49,490 INFO L226 Difference]: Without dead ends: 119 [2020-12-01 15:27:49,490 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-12-01 15:27:49,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-12-01 15:27:49,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2020-12-01 15:27:49,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2020-12-01 15:27:49,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2020-12-01 15:27:49,510 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2020-12-01 15:27:49,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,511 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2020-12-01 15:27:49,511 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,512 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2020-12-01 15:27:49,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-01 15:27:49,514 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,514 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:49,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:27:49,514 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,515 INFO L82 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2020-12-01 15:27:49,516 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,516 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151271183] [2020-12-01 15:27:49,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:49,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:49,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151271183] [2020-12-01 15:27:49,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:49,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:49,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162567812] [2020-12-01 15:27:49,580 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:49,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:49,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:49,583 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand 3 states. [2020-12-01 15:27:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,607 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2020-12-01 15:27:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2020-12-01 15:27:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,610 INFO L225 Difference]: With dead ends: 201 [2020-12-01 15:27:49,613 INFO L226 Difference]: Without dead ends: 121 [2020-12-01 15:27:49,614 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-12-01 15:27:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-01 15:27:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2020-12-01 15:27:49,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-12-01 15:27:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2020-12-01 15:27:49,633 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2020-12-01 15:27:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,634 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2020-12-01 15:27:49,635 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2020-12-01 15:27:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:27:49,637 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,637 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:49,637 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:27:49,637 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2020-12-01 15:27:49,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,638 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671478253] [2020-12-01 15:27:49,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:49,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:49,678 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671478253] [2020-12-01 15:27:49,678 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:49,678 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:49,679 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228961723] [2020-12-01 15:27:49,679 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:49,679 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:49,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:49,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:49,680 INFO L87 Difference]: Start difference. First operand 119 states and 207 transitions. Second operand 3 states. [2020-12-01 15:27:49,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,710 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2020-12-01 15:27:49,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-01 15:27:49,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,711 INFO L225 Difference]: With dead ends: 180 [2020-12-01 15:27:49,712 INFO L226 Difference]: Without dead ends: 123 [2020-12-01 15:27:49,712 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-12-01 15:27:49,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-12-01 15:27:49,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2020-12-01 15:27:49,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-01 15:27:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2020-12-01 15:27:49,732 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2020-12-01 15:27:49,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,733 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2020-12-01 15:27:49,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2020-12-01 15:27:49,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:27:49,734 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,734 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:49,734 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:27:49,734 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2020-12-01 15:27:49,735 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,735 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916007502] [2020-12-01 15:27:49,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:49,768 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916007502] [2020-12-01 15:27:49,768 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:49,768 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:49,768 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947763011] [2020-12-01 15:27:49,769 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:49,769 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:49,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:49,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:49,770 INFO L87 Difference]: Start difference. First operand 121 states and 207 transitions. Second operand 3 states. [2020-12-01 15:27:49,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,799 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2020-12-01 15:27:49,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-01 15:27:49,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,801 INFO L225 Difference]: With dead ends: 345 [2020-12-01 15:27:49,801 INFO L226 Difference]: Without dead ends: 231 [2020-12-01 15:27:49,802 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-12-01 15:27:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2020-12-01 15:27:49,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2020-12-01 15:27:49,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-12-01 15:27:49,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2020-12-01 15:27:49,830 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2020-12-01 15:27:49,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,830 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2020-12-01 15:27:49,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,831 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2020-12-01 15:27:49,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-12-01 15:27:49,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:27:49,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:27:49,837 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,837 INFO L82 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2020-12-01 15:27:49,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624440525] [2020-12-01 15:27:49,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:49,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:49,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624440525] [2020-12-01 15:27:49,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:49,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:49,905 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199536474] [2020-12-01 15:27:49,905 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:49,906 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:49,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:49,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:49,907 INFO L87 Difference]: Start difference. First operand 229 states and 387 transitions. Second operand 3 states. [2020-12-01 15:27:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:49,941 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2020-12-01 15:27:49,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:49,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-12-01 15:27:49,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:49,944 INFO L225 Difference]: With dead ends: 289 [2020-12-01 15:27:49,944 INFO L226 Difference]: Without dead ends: 287 [2020-12-01 15:27:49,945 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-12-01 15:27:49,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2020-12-01 15:27:49,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2020-12-01 15:27:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-12-01 15:27:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2020-12-01 15:27:49,968 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2020-12-01 15:27:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:49,970 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2020-12-01 15:27:49,970 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2020-12-01 15:27:49,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 15:27:49,972 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:49,973 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-12-01 15:27:49,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:27:49,973 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:49,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:49,974 INFO L82 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2020-12-01 15:27:49,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:49,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881623188] [2020-12-01 15:27:49,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,015 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881623188] [2020-12-01 15:27:50,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,017 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136307394] [2020-12-01 15:27:50,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,022 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,025 INFO L87 Difference]: Start difference. First operand 229 states and 383 transitions. Second operand 3 states. [2020-12-01 15:27:50,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,044 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2020-12-01 15:27:50,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-01 15:27:50,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,048 INFO L225 Difference]: With dead ends: 421 [2020-12-01 15:27:50,048 INFO L226 Difference]: Without dead ends: 419 [2020-12-01 15:27:50,048 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-12-01 15:27:50,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2020-12-01 15:27:50,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2020-12-01 15:27:50,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2020-12-01 15:27:50,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2020-12-01 15:27:50,068 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2020-12-01 15:27:50,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,069 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2020-12-01 15:27:50,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,069 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2020-12-01 15:27:50,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 15:27:50,070 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,070 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-12-01 15:27:50,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:27:50,071 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2020-12-01 15:27:50,072 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,072 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341496760] [2020-12-01 15:27:50,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,106 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341496760] [2020-12-01 15:27:50,106 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,107 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267666102] [2020-12-01 15:27:50,107 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,107 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,108 INFO L87 Difference]: Start difference. First operand 321 states and 527 transitions. Second operand 3 states. [2020-12-01 15:27:50,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,170 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2020-12-01 15:27:50,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-01 15:27:50,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,173 INFO L225 Difference]: With dead ends: 757 [2020-12-01 15:27:50,178 INFO L226 Difference]: Without dead ends: 443 [2020-12-01 15:27:50,180 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-12-01 15:27:50,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2020-12-01 15:27:50,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2020-12-01 15:27:50,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2020-12-01 15:27:50,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2020-12-01 15:27:50,204 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2020-12-01 15:27:50,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,205 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2020-12-01 15:27:50,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,205 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2020-12-01 15:27:50,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 15:27:50,206 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,206 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-12-01 15:27:50,206 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:27:50,206 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2020-12-01 15:27:50,207 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,207 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929062471] [2020-12-01 15:27:50,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,243 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929062471] [2020-12-01 15:27:50,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700596803] [2020-12-01 15:27:50,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,245 INFO L87 Difference]: Start difference. First operand 441 states and 715 transitions. Second operand 3 states. [2020-12-01 15:27:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,263 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2020-12-01 15:27:50,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-12-01 15:27:50,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,267 INFO L225 Difference]: With dead ends: 669 [2020-12-01 15:27:50,267 INFO L226 Difference]: Without dead ends: 455 [2020-12-01 15:27:50,268 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-12-01 15:27:50,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2020-12-01 15:27:50,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2020-12-01 15:27:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2020-12-01 15:27:50,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2020-12-01 15:27:50,287 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2020-12-01 15:27:50,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,288 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2020-12-01 15:27:50,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,288 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2020-12-01 15:27:50,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 15:27:50,289 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,289 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-12-01 15:27:50,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:27:50,290 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,290 INFO L82 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2020-12-01 15:27:50,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592826222] [2020-12-01 15:27:50,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,322 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592826222] [2020-12-01 15:27:50,322 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,322 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,323 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115605716] [2020-12-01 15:27:50,323 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,323 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,324 INFO L87 Difference]: Start difference. First operand 453 states and 723 transitions. Second operand 3 states. [2020-12-01 15:27:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,355 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2020-12-01 15:27:50,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-12-01 15:27:50,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,360 INFO L225 Difference]: With dead ends: 809 [2020-12-01 15:27:50,361 INFO L226 Difference]: Without dead ends: 807 [2020-12-01 15:27:50,361 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-12-01 15:27:50,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2020-12-01 15:27:50,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2020-12-01 15:27:50,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 645 states. [2020-12-01 15:27:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2020-12-01 15:27:50,383 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2020-12-01 15:27:50,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,385 INFO L481 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2020-12-01 15:27:50,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,385 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2020-12-01 15:27:50,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-01 15:27:50,387 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,387 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-12-01 15:27:50,388 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:27:50,388 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2020-12-01 15:27:50,389 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,389 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113493564] [2020-12-01 15:27:50,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,425 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113493564] [2020-12-01 15:27:50,425 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,425 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,425 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604331653] [2020-12-01 15:27:50,426 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,426 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,427 INFO L87 Difference]: Start difference. First operand 645 states and 1003 transitions. Second operand 3 states. [2020-12-01 15:27:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,476 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2020-12-01 15:27:50,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2020-12-01 15:27:50,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,485 INFO L225 Difference]: With dead ends: 1497 [2020-12-01 15:27:50,485 INFO L226 Difference]: Without dead ends: 871 [2020-12-01 15:27:50,486 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-12-01 15:27:50,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2020-12-01 15:27:50,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2020-12-01 15:27:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2020-12-01 15:27:50,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2020-12-01 15:27:50,516 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2020-12-01 15:27:50,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,516 INFO L481 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2020-12-01 15:27:50,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,518 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2020-12-01 15:27:50,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:27:50,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,522 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-12-01 15:27:50,522 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:27:50,523 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2020-12-01 15:27:50,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341595145] [2020-12-01 15:27:50,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,559 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341595145] [2020-12-01 15:27:50,559 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,559 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,559 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590300264] [2020-12-01 15:27:50,560 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,561 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,561 INFO L87 Difference]: Start difference. First operand 869 states and 1331 transitions. Second operand 3 states. [2020-12-01 15:27:50,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,586 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2020-12-01 15:27:50,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,587 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-01 15:27:50,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,592 INFO L225 Difference]: With dead ends: 1305 [2020-12-01 15:27:50,592 INFO L226 Difference]: Without dead ends: 887 [2020-12-01 15:27:50,593 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-12-01 15:27:50,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2020-12-01 15:27:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2020-12-01 15:27:50,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 885 states. [2020-12-01 15:27:50,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2020-12-01 15:27:50,621 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2020-12-01 15:27:50,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,622 INFO L481 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2020-12-01 15:27:50,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,622 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2020-12-01 15:27:50,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:27:50,623 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,624 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-12-01 15:27:50,624 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:27:50,624 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,625 INFO L82 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2020-12-01 15:27:50,625 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,625 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280480046] [2020-12-01 15:27:50,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,664 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280480046] [2020-12-01 15:27:50,665 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,665 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,665 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066540320] [2020-12-01 15:27:50,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,667 INFO L87 Difference]: Start difference. First operand 885 states and 1331 transitions. Second operand 3 states. [2020-12-01 15:27:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,696 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2020-12-01 15:27:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-01 15:27:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,706 INFO L225 Difference]: With dead ends: 1545 [2020-12-01 15:27:50,706 INFO L226 Difference]: Without dead ends: 1543 [2020-12-01 15:27:50,708 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-12-01 15:27:50,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2020-12-01 15:27:50,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2020-12-01 15:27:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1285 states. [2020-12-01 15:27:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2020-12-01 15:27:50,750 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2020-12-01 15:27:50,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,750 INFO L481 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2020-12-01 15:27:50,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2020-12-01 15:27:50,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-12-01 15:27:50,753 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,753 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-12-01 15:27:50,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:27:50,753 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2020-12-01 15:27:50,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519520241] [2020-12-01 15:27:50,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,791 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519520241] [2020-12-01 15:27:50,791 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,794 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,794 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612928275] [2020-12-01 15:27:50,795 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,795 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,796 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 transitions. Second operand 3 states. [2020-12-01 15:27:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,833 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2020-12-01 15:27:50,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-12-01 15:27:50,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:50,842 INFO L225 Difference]: With dead ends: 2953 [2020-12-01 15:27:50,842 INFO L226 Difference]: Without dead ends: 1703 [2020-12-01 15:27:50,844 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-12-01 15:27:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2020-12-01 15:27:50,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2020-12-01 15:27:50,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2020-12-01 15:27:50,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2020-12-01 15:27:50,920 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2020-12-01 15:27:50,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:50,922 INFO L481 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2020-12-01 15:27:50,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:50,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2020-12-01 15:27:50,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 15:27:50,927 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:50,927 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-12-01 15:27:50,927 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 15:27:50,927 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:50,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:50,928 INFO L82 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2020-12-01 15:27:50,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:50,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206645061] [2020-12-01 15:27:50,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:50,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:50,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206645061] [2020-12-01 15:27:50,949 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:50,949 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:50,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148592861] [2020-12-01 15:27:50,950 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:50,950 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:50,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:50,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:50,951 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 transitions. Second operand 3 states. [2020-12-01 15:27:50,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:50,991 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2020-12-01 15:27:50,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:50,992 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-01 15:27:50,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:51,001 INFO L225 Difference]: With dead ends: 2553 [2020-12-01 15:27:51,001 INFO L226 Difference]: Without dead ends: 1735 [2020-12-01 15:27:51,005 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-12-01 15:27:51,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2020-12-01 15:27:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2020-12-01 15:27:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2020-12-01 15:27:51,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2020-12-01 15:27:51,059 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2020-12-01 15:27:51,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:51,059 INFO L481 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2020-12-01 15:27:51,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:51,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2020-12-01 15:27:51,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 15:27:51,062 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:51,062 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-12-01 15:27:51,062 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 15:27:51,062 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:51,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:51,063 INFO L82 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2020-12-01 15:27:51,063 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:51,063 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267731904] [2020-12-01 15:27:51,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:51,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:51,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:51,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267731904] [2020-12-01 15:27:51,082 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:51,082 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:51,082 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737306379] [2020-12-01 15:27:51,084 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:51,084 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:51,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:51,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:51,085 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 transitions. Second operand 3 states. [2020-12-01 15:27:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:51,134 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2020-12-01 15:27:51,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:51,134 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-01 15:27:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:51,149 INFO L225 Difference]: With dead ends: 2953 [2020-12-01 15:27:51,149 INFO L226 Difference]: Without dead ends: 2951 [2020-12-01 15:27:51,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-12-01 15:27:51,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2020-12-01 15:27:51,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2020-12-01 15:27:51,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2565 states. [2020-12-01 15:27:51,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2020-12-01 15:27:51,252 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2020-12-01 15:27:51,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:51,253 INFO L481 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2020-12-01 15:27:51,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:51,253 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2020-12-01 15:27:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 15:27:51,256 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:51,257 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-12-01 15:27:51,257 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 15:27:51,257 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:51,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:51,258 INFO L82 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2020-12-01 15:27:51,258 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:51,260 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736647144] [2020-12-01 15:27:51,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:51,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:51,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736647144] [2020-12-01 15:27:51,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:51,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:51,289 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655694219] [2020-12-01 15:27:51,290 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:51,290 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:51,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:51,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:51,291 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 transitions. Second operand 3 states. [2020-12-01 15:27:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:51,367 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2020-12-01 15:27:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:51,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-01 15:27:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:51,383 INFO L225 Difference]: With dead ends: 5833 [2020-12-01 15:27:51,384 INFO L226 Difference]: Without dead ends: 3335 [2020-12-01 15:27:51,387 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-12-01 15:27:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2020-12-01 15:27:51,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2020-12-01 15:27:51,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3333 states. [2020-12-01 15:27:51,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2020-12-01 15:27:51,490 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2020-12-01 15:27:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:51,490 INFO L481 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2020-12-01 15:27:51,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2020-12-01 15:27:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 15:27:51,495 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:51,495 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-12-01 15:27:51,495 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 15:27:51,495 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2020-12-01 15:27:51,496 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:51,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510789318] [2020-12-01 15:27:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:51,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:51,524 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510789318] [2020-12-01 15:27:51,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:51,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:51,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551444559] [2020-12-01 15:27:51,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:51,525 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:51,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:51,526 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 transitions. Second operand 3 states. [2020-12-01 15:27:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:51,617 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2020-12-01 15:27:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:51,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-01 15:27:51,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:51,635 INFO L225 Difference]: With dead ends: 5001 [2020-12-01 15:27:51,635 INFO L226 Difference]: Without dead ends: 3399 [2020-12-01 15:27:51,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-12-01 15:27:51,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2020-12-01 15:27:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2020-12-01 15:27:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3397 states. [2020-12-01 15:27:51,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2020-12-01 15:27:51,758 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2020-12-01 15:27:51,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:51,759 INFO L481 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2020-12-01 15:27:51,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:51,759 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2020-12-01 15:27:51,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 15:27:51,764 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:51,764 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-12-01 15:27:51,765 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 15:27:51,765 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:51,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:51,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2020-12-01 15:27:51,766 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:51,766 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194251351] [2020-12-01 15:27:51,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:51,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:51,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:51,815 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194251351] [2020-12-01 15:27:51,815 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:51,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:51,816 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352965911] [2020-12-01 15:27:51,816 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:51,816 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:51,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:51,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:51,817 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 transitions. Second operand 3 states. [2020-12-01 15:27:51,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:51,907 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2020-12-01 15:27:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:51,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-01 15:27:51,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:51,935 INFO L225 Difference]: With dead ends: 5641 [2020-12-01 15:27:51,935 INFO L226 Difference]: Without dead ends: 5639 [2020-12-01 15:27:51,937 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-12-01 15:27:51,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2020-12-01 15:27:52,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2020-12-01 15:27:52,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5125 states. [2020-12-01 15:27:52,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2020-12-01 15:27:52,119 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2020-12-01 15:27:52,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:52,120 INFO L481 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2020-12-01 15:27:52,120 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:52,120 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2020-12-01 15:27:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-12-01 15:27:52,129 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:52,130 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-12-01 15:27:52,130 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 15:27:52,130 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:52,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:52,130 INFO L82 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2020-12-01 15:27:52,131 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:52,131 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295668712] [2020-12-01 15:27:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:52,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:52,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:52,150 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295668712] [2020-12-01 15:27:52,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:52,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:52,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275344321] [2020-12-01 15:27:52,151 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:52,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:52,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:52,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:52,153 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 transitions. Second operand 3 states. [2020-12-01 15:27:52,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:52,262 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2020-12-01 15:27:52,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:52,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-12-01 15:27:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:52,292 INFO L225 Difference]: With dead ends: 11529 [2020-12-01 15:27:52,292 INFO L226 Difference]: Without dead ends: 6535 [2020-12-01 15:27:52,299 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-12-01 15:27:52,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2020-12-01 15:27:52,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2020-12-01 15:27:52,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6533 states. [2020-12-01 15:27:52,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2020-12-01 15:27:52,517 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2020-12-01 15:27:52,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:52,517 INFO L481 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2020-12-01 15:27:52,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2020-12-01 15:27:52,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:27:52,525 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:52,525 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-12-01 15:27:52,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 15:27:52,526 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:52,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:52,526 INFO L82 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2020-12-01 15:27:52,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:52,526 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875761253] [2020-12-01 15:27:52,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:52,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:52,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:52,551 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875761253] [2020-12-01 15:27:52,551 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:52,551 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:52,551 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601625883] [2020-12-01 15:27:52,552 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:52,552 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:52,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:52,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:52,555 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 transitions. Second operand 3 states. [2020-12-01 15:27:52,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:52,652 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2020-12-01 15:27:52,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:52,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-01 15:27:52,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:52,665 INFO L225 Difference]: With dead ends: 9801 [2020-12-01 15:27:52,666 INFO L226 Difference]: Without dead ends: 6663 [2020-12-01 15:27:52,670 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-12-01 15:27:52,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2020-12-01 15:27:52,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2020-12-01 15:27:52,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6661 states. [2020-12-01 15:27:52,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2020-12-01 15:27:52,889 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2020-12-01 15:27:52,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:52,889 INFO L481 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2020-12-01 15:27:52,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:52,890 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2020-12-01 15:27:52,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:27:52,897 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:52,897 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-12-01 15:27:52,897 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-12-01 15:27:52,897 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:52,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:52,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2020-12-01 15:27:52,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:52,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532943591] [2020-12-01 15:27:52,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:52,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:52,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:52,920 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532943591] [2020-12-01 15:27:52,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:52,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:52,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987494348] [2020-12-01 15:27:52,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:52,920 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:52,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:52,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:52,921 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 transitions. Second operand 3 states. [2020-12-01 15:27:53,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:53,127 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2020-12-01 15:27:53,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:53,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-01 15:27:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:53,146 INFO L225 Difference]: With dead ends: 10759 [2020-12-01 15:27:53,146 INFO L226 Difference]: Without dead ends: 10757 [2020-12-01 15:27:53,149 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-12-01 15:27:53,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2020-12-01 15:27:53,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2020-12-01 15:27:53,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2020-12-01 15:27:53,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2020-12-01 15:27:53,397 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2020-12-01 15:27:53,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:53,398 INFO L481 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2020-12-01 15:27:53,398 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:53,398 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2020-12-01 15:27:53,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-01 15:27:53,414 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:27:53,414 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-12-01 15:27:53,414 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 15:27:53,414 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:27:53,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:27:53,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2020-12-01 15:27:53,415 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:27:53,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484122440] [2020-12-01 15:27:53,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:27:53,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:27:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:27:53,448 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484122440] [2020-12-01 15:27:53,449 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:27:53,449 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:27:53,449 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849370367] [2020-12-01 15:27:53,449 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:27:53,449 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:27:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:27:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:27:53,450 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 transitions. Second operand 3 states. [2020-12-01 15:27:53,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:27:53,660 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2020-12-01 15:27:53,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:27:53,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2020-12-01 15:27:53,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:27:53,661 INFO L225 Difference]: With dead ends: 22789 [2020-12-01 15:27:53,661 INFO L226 Difference]: Without dead ends: 0 [2020-12-01 15:27:53,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-12-01 15:27:53,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-12-01 15:27:53,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-12-01 15:27:53,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-12-01 15:27:53,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-12-01 15:27:53,680 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2020-12-01 15:27:53,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:27:53,680 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-12-01 15:27:53,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:27:53,680 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-12-01 15:27:53,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-12-01 15:27:53,681 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-12-01 15:27:53,683 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-12-01 15:27:53,699 INFO L262 CegarLoopResult]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,699 INFO L262 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2020-12-01 15:27:53,700 INFO L262 CegarLoopResult]: For program point L3(line 3) no Hoare annotation was computed. [2020-12-01 15:27:53,700 INFO L262 CegarLoopResult]: For program point L127(line 127) no Hoare annotation was computed. [2020-12-01 15:27:53,700 INFO L262 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-12-01 15:27:53,700 INFO L262 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-12-01 15:27:53,700 INFO L262 CegarLoopResult]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,700 INFO L262 CegarLoopResult]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,700 INFO L262 CegarLoopResult]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,701 INFO L262 CegarLoopResult]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,701 INFO L262 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2020-12-01 15:27:53,701 INFO L262 CegarLoopResult]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,702 INFO L262 CegarLoopResult]: For program point L137(line 137) no Hoare annotation was computed. [2020-12-01 15:27:53,702 INFO L262 CegarLoopResult]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,702 INFO L262 CegarLoopResult]: For program point L63(lines 63 65) no Hoare annotation was computed. [2020-12-01 15:27:53,702 INFO L262 CegarLoopResult]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,702 INFO L262 CegarLoopResult]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,702 INFO L262 CegarLoopResult]: For program point L122(line 122) no Hoare annotation was computed. [2020-12-01 15:27:53,702 INFO L265 CegarLoopResult]: At program point L147(lines 7 151) the Hoare annotation is: true [2020-12-01 15:27:53,703 INFO L262 CegarLoopResult]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,703 INFO L262 CegarLoopResult]: For program point L40(lines 40 42) no Hoare annotation was computed. [2020-12-01 15:27:53,703 INFO L262 CegarLoopResult]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,703 INFO L262 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-12-01 15:27:53,703 INFO L262 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2020-12-01 15:27:53,703 INFO L262 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2020-12-01 15:27:53,703 INFO L262 CegarLoopResult]: For program point L132(line 132) no Hoare annotation was computed. [2020-12-01 15:27:53,704 INFO L262 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-12-01 15:27:53,704 INFO L262 CegarLoopResult]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,704 INFO L262 CegarLoopResult]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,704 INFO L262 CegarLoopResult]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,704 INFO L265 CegarLoopResult]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2020-12-01 15:27:53,704 INFO L262 CegarLoopResult]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,704 INFO L262 CegarLoopResult]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,704 INFO L265 CegarLoopResult]: At program point L150(lines 6 151) the Hoare annotation is: true [2020-12-01 15:27:53,705 INFO L262 CegarLoopResult]: For program point L117(line 117) no Hoare annotation was computed. [2020-12-01 15:27:53,705 INFO L262 CegarLoopResult]: For program point L142(line 142) no Hoare annotation was computed. [2020-12-01 15:27:53,705 INFO L258 CegarLoopResult]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2020-12-01 15:27:53,705 INFO L262 CegarLoopResult]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2020-12-01 15:27:53,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:27:53 BoogieIcfgContainer [2020-12-01 15:27:53,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:27:53,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:27:53,716 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:27:53,716 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:27:53,717 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:27:48" (3/4) ... [2020-12-01 15:27:53,719 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-12-01 15:27:53,733 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-12-01 15:27:53,733 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-12-01 15:27:53,734 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-01 15:27:53,734 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-12-01 15:27:53,793 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ccbfc0f6-65cd-45aa-b231-ef4f6626adf3/bin/uautomizer/witness.graphml [2020-12-01 15:27:53,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:27:53,795 INFO L168 Benchmark]: Toolchain (without parser) took 5930.12 ms. Allocated memory was 127.9 MB in the beginning and 333.4 MB in the end (delta: 205.5 MB). Free memory was 97.8 MB in the beginning and 230.0 MB in the end (delta: -132.2 MB). Peak memory consumption was 71.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:53,796 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 81.8 MB. Free memory was 42.3 MB in the beginning and 42.2 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:27:53,797 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.16 ms. Allocated memory is still 127.9 MB. Free memory was 97.8 MB in the beginning and 104.1 MB in the end (delta: -6.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:53,797 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.69 ms. Allocated memory is still 127.9 MB. Free memory was 104.1 MB in the beginning and 102.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:27:53,797 INFO L168 Benchmark]: Boogie Preprocessor took 24.36 ms. Allocated memory is still 127.9 MB. Free memory was 102.4 MB in the beginning and 101.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:27:53,798 INFO L168 Benchmark]: RCFGBuilder took 360.23 ms. Allocated memory is still 127.9 MB. Free memory was 101.2 MB in the beginning and 82.7 MB in the end (delta: 18.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:53,798 INFO L168 Benchmark]: TraceAbstraction took 5170.30 ms. Allocated memory was 127.9 MB in the beginning and 333.4 MB in the end (delta: 205.5 MB). Free memory was 82.3 MB in the beginning and 234.2 MB in the end (delta: -151.8 MB). Peak memory consumption was 55.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:53,799 INFO L168 Benchmark]: Witness Printer took 77.69 ms. Allocated memory is still 333.4 MB. Free memory was 234.2 MB in the beginning and 230.0 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:27:53,801 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.19 ms. Allocated memory is still 81.8 MB. Free memory was 42.3 MB in the beginning and 42.2 MB in the end (delta: 70.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 256.16 ms. Allocated memory is still 127.9 MB. Free memory was 97.8 MB in the beginning and 104.1 MB in the end (delta: -6.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 34.69 ms. Allocated memory is still 127.9 MB. Free memory was 104.1 MB in the beginning and 102.4 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 24.36 ms. Allocated memory is still 127.9 MB. Free memory was 102.4 MB in the beginning and 101.2 MB in the end (delta: 1.2 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 360.23 ms. Allocated memory is still 127.9 MB. Free memory was 101.2 MB in the beginning and 82.7 MB in the end (delta: 18.4 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5170.30 ms. Allocated memory was 127.9 MB in the beginning and 333.4 MB in the end (delta: 205.5 MB). Free memory was 82.3 MB in the beginning and 234.2 MB in the end (delta: -151.8 MB). Peak memory consumption was 55.7 MB. Max. memory is 16.1 GB. * Witness Printer took 77.69 ms. Allocated memory is still 333.4 MB. Free memory was 234.2 MB in the beginning and 230.0 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.0s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 1.8s, 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.2s 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.6s 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.2s 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...