./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC --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 115ea8a51a281ddca5da7e6b8ebbaa38c9e9f09c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 00:33:16,225 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:33:16,227 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:33:16,261 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:33:16,262 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:33:16,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:33:16,266 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:33:16,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:33:16,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:33:16,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:33:16,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:33:16,276 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:33:16,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:33:16,279 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:33:16,280 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:33:16,282 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:33:16,283 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:33:16,285 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:33:16,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:33:16,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:33:16,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:33:16,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:33:16,296 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:33:16,297 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:33:16,301 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:33:16,301 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:33:16,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:33:16,303 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:33:16,304 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:33:16,305 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:33:16,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:33:16,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:33:16,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:33:16,310 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:33:16,311 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:33:16,312 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:33:16,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:33:16,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:33:16,313 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:33:16,315 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:33:16,316 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:33:16,317 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:33:16,346 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:33:16,349 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:33:16,351 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:33:16,352 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:33:16,352 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:33:16,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:33:16,353 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:33:16,353 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:33:16,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:33:16,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:33:16,363 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:33:16,363 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:33:16,363 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:33:16,364 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:33:16,364 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:33:16,364 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:33:16,365 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:33:16,365 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:33:16,366 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:33:16,366 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:33:16,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:33:16,367 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:33:16,367 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:33:16,367 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:33:16,368 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:33:16,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:33:16,368 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:33:16,369 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:33:16,369 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_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/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_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC 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 -> 115ea8a51a281ddca5da7e6b8ebbaa38c9e9f09c [2021-10-11 00:33:16,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:33:16,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:33:16,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:33:16,770 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:33:16,771 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:33:16,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i [2021-10-11 00:33:16,842 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/data/3c1bd88c1/699c8d30ac99450b81dbd5091b922f20/FLAG946e9911f [2021-10-11 00:33:17,453 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:33:17,454 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i [2021-10-11 00:33:17,479 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/data/3c1bd88c1/699c8d30ac99450b81dbd5091b922f20/FLAG946e9911f [2021-10-11 00:33:17,709 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/data/3c1bd88c1/699c8d30ac99450b81dbd5091b922f20 [2021-10-11 00:33:17,712 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:33:17,714 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:33:17,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:33:17,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:33:17,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:33:17,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:17" (1/1) ... [2021-10-11 00:33:17,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b9de1b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:17, skipping insertion in model container [2021-10-11 00:33:17,723 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:17" (1/1) ... [2021-10-11 00:33:17,731 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:33:17,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:33:18,030 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i[949,962] [2021-10-11 00:33:18,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:33:18,277 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:33:18,292 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/sv-benchmarks/c/pthread-wmm/safe011_rmo.opt.i[949,962] [2021-10-11 00:33:18,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:33:18,439 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:33:18,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18 WrapperNode [2021-10-11 00:33:18,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:33:18,442 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:33:18,442 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:33:18,442 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:33:18,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:33:18,562 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:33:18,563 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:33:18,563 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:33:18,573 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,612 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,633 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... [2021-10-11 00:33:18,652 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:33:18,653 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:33:18,654 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:33:18,654 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:33:18,655 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 00:33:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 00:33:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:33:18,755 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 00:33:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 00:33:18,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 00:33:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 00:33:18,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 00:33:18,756 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-10-11 00:33:18,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-10-11 00:33:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:33:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 00:33:18,757 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:33:18,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:33:18,759 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 00:33:21,310 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:33:21,310 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 00:33:21,314 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:21 BoogieIcfgContainer [2021-10-11 00:33:21,314 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:33:21,317 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:33:21,317 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:33:21,321 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:33:21,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:33:17" (1/3) ... [2021-10-11 00:33:21,323 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bd426c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:21, skipping insertion in model container [2021-10-11 00:33:21,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:18" (2/3) ... [2021-10-11 00:33:21,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40bd426c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:21, skipping insertion in model container [2021-10-11 00:33:21,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:21" (3/3) ... [2021-10-11 00:33:21,326 INFO L111 eAbstractionObserver]: Analyzing ICFG safe011_rmo.opt.i [2021-10-11 00:33:21,346 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 00:33:21,346 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:33:21,350 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 00:33:21,351 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 00:33:21,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,401 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,401 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,402 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,402 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,403 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,403 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,404 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,404 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,404 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,405 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,405 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,406 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,407 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,408 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,409 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,410 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,411 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,412 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,413 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,415 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,415 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,416 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,416 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,417 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,417 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,421 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,422 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,423 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,426 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,426 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,427 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,427 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,427 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,428 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,428 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,429 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,430 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,431 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,432 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,435 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,436 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,440 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,441 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,444 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,445 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,447 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,447 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,448 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,449 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,450 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,450 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,457 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,458 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,462 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 00:33:21,465 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 00:33:21,477 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-10-11 00:33:21,514 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:33:21,516 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:33:21,516 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:33:21,517 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:33:21,517 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:33:21,517 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:33:21,517 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:33:21,517 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:33:21,533 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 00:33:21,535 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 105 places, 97 transitions, 209 flow [2021-10-11 00:33:21,538 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 105 places, 97 transitions, 209 flow [2021-10-11 00:33:21,540 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 105 places, 97 transitions, 209 flow [2021-10-11 00:33:21,621 INFO L129 PetriNetUnfolder]: 2/94 cut-off events. [2021-10-11 00:33:21,621 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 00:33:21,627 INFO L84 FinitePrefix]: Finished finitePrefix Result has 104 conditions, 94 events. 2/94 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/90 useless extension candidates. Maximal degree in co-relation 61. Up to 2 conditions per place. [2021-10-11 00:33:21,633 INFO L116 LiptonReduction]: Number of co-enabled transitions 1694 [2021-10-11 00:33:22,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:22,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,703 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:22,708 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:22,714 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:22,748 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,749 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:22,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:22,761 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,764 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:22,768 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:22,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:22,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:22,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:22,868 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 1] term [2021-10-11 00:33:22,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:22,919 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:22,920 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:22,921 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:33:22,921 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:23,242 WARN L197 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2021-10-11 00:33:23,382 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2021-10-11 00:33:23,931 WARN L197 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 84 [2021-10-11 00:33:24,157 WARN L197 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-10-11 00:33:24,232 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,232 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,233 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,234 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,237 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,241 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,284 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,284 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,288 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,290 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,293 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,294 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,364 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,373 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,408 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,408 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,409 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,412 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,413 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,415 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,467 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,469 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,469 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,474 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,474 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,498 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,498 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,499 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,499 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:24,501 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,502 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,504 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:24,504 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:24,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:24,568 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:24,569 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:33:24,569 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:24,583 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 00:33:24,583 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:24,585 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 00:33:24,585 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:24,586 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 2, 1] term [2021-10-11 00:33:24,586 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:24,638 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:24,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:24,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:33:24,639 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:25,606 WARN L197 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 185 [2021-10-11 00:33:26,090 WARN L197 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 183 [2021-10-11 00:33:27,967 WARN L197 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 310 DAG size of output: 266 [2021-10-11 00:33:28,896 WARN L197 SmtUtils]: Spent 926.00 ms on a formula simplification that was a NOOP. DAG size: 263 [2021-10-11 00:33:29,040 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,041 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:29,042 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:29,044 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,045 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:29,047 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,048 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:29,075 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,076 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:29,076 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,077 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:29,079 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,080 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:29,086 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:29,086 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:29,591 WARN L197 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-10-11 00:33:29,895 WARN L197 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-10-11 00:33:30,077 WARN L197 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-10-11 00:33:30,121 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,122 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,122 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,123 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,128 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,154 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,155 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,155 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,157 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,158 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,160 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,161 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:33:30,410 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,411 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 00:33:30,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,443 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:30,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:30,445 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:33:30,445 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:30,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,487 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,487 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,519 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,522 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,530 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,530 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 00:33:30,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,849 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:30,850 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:30,851 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:33:30,851 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:30,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 3, 2, 1] term [2021-10-11 00:33:30,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,883 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2021-10-11 00:33:30,883 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,983 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,984 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:30,985 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,986 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:30,988 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:30,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,007 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,007 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,008 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,008 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,010 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,011 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,012 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,013 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,390 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,391 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,396 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,417 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,418 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,418 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,451 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,452 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,453 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,453 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,455 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,455 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,458 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,482 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,484 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,486 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,486 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,525 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:31,526 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,527 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:33:31,527 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,556 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 00:33:31,556 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,557 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 1] term [2021-10-11 00:33:31,558 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 00:33:31,648 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,649 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,650 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,650 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,652 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,652 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,655 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,678 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,678 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,679 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,680 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 00:33:31,681 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,682 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:31,684 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 00:33:31,685 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 00:33:32,888 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-10-11 00:33:33,029 WARN L197 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-10-11 00:33:33,178 WARN L197 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2021-10-11 00:33:33,321 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2021-10-11 00:33:33,695 WARN L197 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2021-10-11 00:33:33,856 WARN L197 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 00:33:34,302 WARN L197 SmtUtils]: Spent 445.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 112 [2021-10-11 00:33:34,461 WARN L197 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 00:33:34,470 INFO L131 LiptonReduction]: Checked pairs total: 4814 [2021-10-11 00:33:34,470 INFO L133 LiptonReduction]: Total number of compositions: 81 [2021-10-11 00:33:34,478 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2021-10-11 00:33:34,556 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 974 states. [2021-10-11 00:33:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states. [2021-10-11 00:33:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-11 00:33:34,563 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:34,564 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-11 00:33:34,565 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:34,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:34,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1057934, now seen corresponding path program 1 times [2021-10-11 00:33:34,581 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:34,582 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709125165] [2021-10-11 00:33:34,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:34,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:34,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:34,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709125165] [2021-10-11 00:33:34,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:34,868 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 00:33:34,869 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220047693] [2021-10-11 00:33:34,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:34,874 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:34,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:34,895 INFO L87 Difference]: Start difference. First operand 974 states. Second operand 3 states. [2021-10-11 00:33:35,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:35,016 INFO L93 Difference]: Finished difference Result 812 states and 2575 transitions. [2021-10-11 00:33:35,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:35,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-10-11 00:33:35,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:35,055 INFO L225 Difference]: With dead ends: 812 [2021-10-11 00:33:35,055 INFO L226 Difference]: Without dead ends: 687 [2021-10-11 00:33:35,057 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:35,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2021-10-11 00:33:35,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2021-10-11 00:33:35,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 687 states. [2021-10-11 00:33:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2021-10-11 00:33:35,182 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 3 [2021-10-11 00:33:35,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:35,182 INFO L481 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2021-10-11 00:33:35,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2021-10-11 00:33:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 00:33:35,185 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:35,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:35,185 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:33:35,186 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:35,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:35,189 INFO L82 PathProgramCache]: Analyzing trace with hash -332907457, now seen corresponding path program 1 times [2021-10-11 00:33:35,189 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:35,190 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053349118] [2021-10-11 00:33:35,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:35,394 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053349118] [2021-10-11 00:33:35,394 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:35,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:33:35,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511042685] [2021-10-11 00:33:35,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:35,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:35,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:35,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:35,397 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand 4 states. [2021-10-11 00:33:35,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:35,439 INFO L93 Difference]: Finished difference Result 792 states and 2384 transitions. [2021-10-11 00:33:35,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:35,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-10-11 00:33:35,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:35,446 INFO L225 Difference]: With dead ends: 792 [2021-10-11 00:33:35,447 INFO L226 Difference]: Without dead ends: 667 [2021-10-11 00:33:35,447 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:35,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2021-10-11 00:33:35,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 667. [2021-10-11 00:33:35,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2021-10-11 00:33:35,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 2074 transitions. [2021-10-11 00:33:35,475 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 2074 transitions. Word has length 10 [2021-10-11 00:33:35,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:35,476 INFO L481 AbstractCegarLoop]: Abstraction has 667 states and 2074 transitions. [2021-10-11 00:33:35,477 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:35,477 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 2074 transitions. [2021-10-11 00:33:35,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 00:33:35,479 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:35,480 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:35,480 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:33:35,480 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:35,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:35,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1082766274, now seen corresponding path program 1 times [2021-10-11 00:33:35,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:35,481 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865787454] [2021-10-11 00:33:35,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:35,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:35,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865787454] [2021-10-11 00:33:35,579 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:35,579 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:33:35,579 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374931542] [2021-10-11 00:33:35,579 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:35,580 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:35,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:35,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:35,581 INFO L87 Difference]: Start difference. First operand 667 states and 2074 transitions. Second operand 4 states. [2021-10-11 00:33:35,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:35,623 INFO L93 Difference]: Finished difference Result 736 states and 2205 transitions. [2021-10-11 00:33:35,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:35,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2021-10-11 00:33:35,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:35,630 INFO L225 Difference]: With dead ends: 736 [2021-10-11 00:33:35,630 INFO L226 Difference]: Without dead ends: 621 [2021-10-11 00:33:35,631 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:35,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2021-10-11 00:33:35,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2021-10-11 00:33:35,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2021-10-11 00:33:35,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1910 transitions. [2021-10-11 00:33:35,656 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1910 transitions. Word has length 11 [2021-10-11 00:33:35,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:35,656 INFO L481 AbstractCegarLoop]: Abstraction has 621 states and 1910 transitions. [2021-10-11 00:33:35,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:35,657 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1910 transitions. [2021-10-11 00:33:35,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 00:33:35,664 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:35,664 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:35,664 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:33:35,665 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:35,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:35,666 INFO L82 PathProgramCache]: Analyzing trace with hash -794597533, now seen corresponding path program 1 times [2021-10-11 00:33:35,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:35,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168039884] [2021-10-11 00:33:35,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:35,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:35,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:35,797 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168039884] [2021-10-11 00:33:35,797 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:35,798 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:33:35,798 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517603106] [2021-10-11 00:33:35,798 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:35,798 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:35,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:35,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:35,799 INFO L87 Difference]: Start difference. First operand 621 states and 1910 transitions. Second operand 4 states. [2021-10-11 00:33:35,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:35,889 INFO L93 Difference]: Finished difference Result 693 states and 2068 transitions. [2021-10-11 00:33:35,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:35,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 00:33:35,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:35,896 INFO L225 Difference]: With dead ends: 693 [2021-10-11 00:33:35,896 INFO L226 Difference]: Without dead ends: 613 [2021-10-11 00:33:35,897 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:35,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2021-10-11 00:33:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 613. [2021-10-11 00:33:35,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2021-10-11 00:33:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1880 transitions. [2021-10-11 00:33:35,919 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1880 transitions. Word has length 12 [2021-10-11 00:33:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:35,919 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 1880 transitions. [2021-10-11 00:33:35,920 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:35,920 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1880 transitions. [2021-10-11 00:33:35,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 00:33:35,921 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:35,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:35,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:33:35,921 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:35,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:35,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1135653700, now seen corresponding path program 1 times [2021-10-11 00:33:35,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:35,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528527508] [2021-10-11 00:33:35,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:36,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:36,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528527508] [2021-10-11 00:33:36,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:36,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:36,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268602868] [2021-10-11 00:33:36,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:33:36,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:36,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:36,015 INFO L87 Difference]: Start difference. First operand 613 states and 1880 transitions. Second operand 5 states. [2021-10-11 00:33:36,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:36,085 INFO L93 Difference]: Finished difference Result 819 states and 2473 transitions. [2021-10-11 00:33:36,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:36,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2021-10-11 00:33:36,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:36,090 INFO L225 Difference]: With dead ends: 819 [2021-10-11 00:33:36,090 INFO L226 Difference]: Without dead ends: 431 [2021-10-11 00:33:36,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:33:36,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-10-11 00:33:36,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2021-10-11 00:33:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2021-10-11 00:33:36,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1248 transitions. [2021-10-11 00:33:36,106 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1248 transitions. Word has length 13 [2021-10-11 00:33:36,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:36,106 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1248 transitions. [2021-10-11 00:33:36,106 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:33:36,107 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1248 transitions. [2021-10-11 00:33:36,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:33:36,108 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:36,108 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:36,108 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:33:36,108 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:36,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:36,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1439607342, now seen corresponding path program 1 times [2021-10-11 00:33:36,109 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:36,109 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175817023] [2021-10-11 00:33:36,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:36,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:36,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:36,201 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175817023] [2021-10-11 00:33:36,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:36,202 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:36,202 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720920444] [2021-10-11 00:33:36,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:33:36,203 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:36,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:36,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:36,203 INFO L87 Difference]: Start difference. First operand 431 states and 1248 transitions. Second operand 5 states. [2021-10-11 00:33:36,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:36,337 INFO L93 Difference]: Finished difference Result 483 states and 1369 transitions. [2021-10-11 00:33:36,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:36,338 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 00:33:36,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:36,342 INFO L225 Difference]: With dead ends: 483 [2021-10-11 00:33:36,342 INFO L226 Difference]: Without dead ends: 438 [2021-10-11 00:33:36,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2021-10-11 00:33:36,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 434. [2021-10-11 00:33:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2021-10-11 00:33:36,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1256 transitions. [2021-10-11 00:33:36,359 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1256 transitions. Word has length 14 [2021-10-11 00:33:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:36,359 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 1256 transitions. [2021-10-11 00:33:36,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:33:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1256 transitions. [2021-10-11 00:33:36,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:33:36,360 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:36,361 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:36,361 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:33:36,361 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:36,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1439618874, now seen corresponding path program 1 times [2021-10-11 00:33:36,362 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:36,362 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759465248] [2021-10-11 00:33:36,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:36,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:36,506 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759465248] [2021-10-11 00:33:36,506 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:36,506 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:36,506 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024403632] [2021-10-11 00:33:36,507 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:33:36,507 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:36,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:36,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:36,508 INFO L87 Difference]: Start difference. First operand 434 states and 1256 transitions. Second operand 5 states. [2021-10-11 00:33:36,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:36,608 INFO L93 Difference]: Finished difference Result 478 states and 1346 transitions. [2021-10-11 00:33:36,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:36,610 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 00:33:36,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:36,613 INFO L225 Difference]: With dead ends: 478 [2021-10-11 00:33:36,613 INFO L226 Difference]: Without dead ends: 430 [2021-10-11 00:33:36,613 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2021-10-11 00:33:36,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2021-10-11 00:33:36,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2021-10-11 00:33:36,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 1240 transitions. [2021-10-11 00:33:36,627 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 1240 transitions. Word has length 14 [2021-10-11 00:33:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:36,627 INFO L481 AbstractCegarLoop]: Abstraction has 430 states and 1240 transitions. [2021-10-11 00:33:36,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:33:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 1240 transitions. [2021-10-11 00:33:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 00:33:36,628 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:36,628 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:36,629 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:33:36,629 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash -298495698, now seen corresponding path program 2 times [2021-10-11 00:33:36,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:36,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065955983] [2021-10-11 00:33:36,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:36,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:36,716 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065955983] [2021-10-11 00:33:36,716 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:36,716 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:36,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613095438] [2021-10-11 00:33:36,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:33:36,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:36,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:36,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:36,718 INFO L87 Difference]: Start difference. First operand 430 states and 1240 transitions. Second operand 6 states. [2021-10-11 00:33:36,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:36,885 INFO L93 Difference]: Finished difference Result 481 states and 1355 transitions. [2021-10-11 00:33:36,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:33:36,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2021-10-11 00:33:36,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:36,888 INFO L225 Difference]: With dead ends: 481 [2021-10-11 00:33:36,888 INFO L226 Difference]: Without dead ends: 434 [2021-10-11 00:33:36,889 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:33:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2021-10-11 00:33:36,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2021-10-11 00:33:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2021-10-11 00:33:36,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 1243 transitions. [2021-10-11 00:33:36,903 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 1243 transitions. Word has length 14 [2021-10-11 00:33:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:36,903 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 1243 transitions. [2021-10-11 00:33:36,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:33:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 1243 transitions. [2021-10-11 00:33:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:33:36,905 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:36,905 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:36,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:33:36,905 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:36,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:36,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1678114700, now seen corresponding path program 1 times [2021-10-11 00:33:36,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:36,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229704562] [2021-10-11 00:33:36,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:36,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:37,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:37,014 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229704562] [2021-10-11 00:33:37,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:37,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:37,015 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387222668] [2021-10-11 00:33:37,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:33:37,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:37,016 INFO L87 Difference]: Start difference. First operand 431 states and 1243 transitions. Second operand 6 states. [2021-10-11 00:33:37,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:37,228 INFO L93 Difference]: Finished difference Result 545 states and 1541 transitions. [2021-10-11 00:33:37,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-10-11 00:33:37,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 00:33:37,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:37,233 INFO L225 Difference]: With dead ends: 545 [2021-10-11 00:33:37,233 INFO L226 Difference]: Without dead ends: 483 [2021-10-11 00:33:37,234 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-10-11 00:33:37,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2021-10-11 00:33:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 483. [2021-10-11 00:33:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2021-10-11 00:33:37,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 1385 transitions. [2021-10-11 00:33:37,249 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 1385 transitions. Word has length 15 [2021-10-11 00:33:37,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:37,250 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 1385 transitions. [2021-10-11 00:33:37,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:33:37,250 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 1385 transitions. [2021-10-11 00:33:37,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:33:37,251 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:37,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:37,251 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:33:37,252 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:37,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:37,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1678107973, now seen corresponding path program 1 times [2021-10-11 00:33:37,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:37,252 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701070442] [2021-10-11 00:33:37,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:37,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:37,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701070442] [2021-10-11 00:33:37,396 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:37,396 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:37,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751134790] [2021-10-11 00:33:37,397 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:33:37,397 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:37,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:37,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:37,398 INFO L87 Difference]: Start difference. First operand 483 states and 1385 transitions. Second operand 6 states. [2021-10-11 00:33:37,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:37,572 INFO L93 Difference]: Finished difference Result 549 states and 1542 transitions. [2021-10-11 00:33:37,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:37,573 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 00:33:37,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:37,578 INFO L225 Difference]: With dead ends: 549 [2021-10-11 00:33:37,578 INFO L226 Difference]: Without dead ends: 509 [2021-10-11 00:33:37,578 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:33:37,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2021-10-11 00:33:37,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 485. [2021-10-11 00:33:37,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2021-10-11 00:33:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1380 transitions. [2021-10-11 00:33:37,599 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1380 transitions. Word has length 15 [2021-10-11 00:33:37,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:37,599 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1380 transitions. [2021-10-11 00:33:37,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:33:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1380 transitions. [2021-10-11 00:33:37,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:33:37,601 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:37,601 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:37,601 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:33:37,602 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:37,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:37,602 INFO L82 PathProgramCache]: Analyzing trace with hash 1677946525, now seen corresponding path program 1 times [2021-10-11 00:33:37,602 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:37,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078050560] [2021-10-11 00:33:37,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:37,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:37,756 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078050560] [2021-10-11 00:33:37,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:37,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:37,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710441624] [2021-10-11 00:33:37,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:33:37,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:37,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:37,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:37,759 INFO L87 Difference]: Start difference. First operand 485 states and 1380 transitions. Second operand 6 states. [2021-10-11 00:33:37,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:37,878 INFO L93 Difference]: Finished difference Result 549 states and 1544 transitions. [2021-10-11 00:33:37,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:37,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2021-10-11 00:33:37,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:37,885 INFO L225 Difference]: With dead ends: 549 [2021-10-11 00:33:37,885 INFO L226 Difference]: Without dead ends: 517 [2021-10-11 00:33:37,885 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:33:37,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2021-10-11 00:33:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 517. [2021-10-11 00:33:37,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2021-10-11 00:33:37,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 1476 transitions. [2021-10-11 00:33:37,914 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 1476 transitions. Word has length 15 [2021-10-11 00:33:37,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:37,914 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 1476 transitions. [2021-10-11 00:33:37,914 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:33:37,914 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 1476 transitions. [2021-10-11 00:33:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-11 00:33:37,916 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:37,916 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:37,916 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:33:37,916 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1678465465, now seen corresponding path program 2 times [2021-10-11 00:33:37,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:37,917 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913681514] [2021-10-11 00:33:37,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:37,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:38,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:38,091 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913681514] [2021-10-11 00:33:38,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:38,092 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:33:38,092 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419426492] [2021-10-11 00:33:38,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:33:38,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:38,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:33:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:33:38,098 INFO L87 Difference]: Start difference. First operand 517 states and 1476 transitions. Second operand 7 states. [2021-10-11 00:33:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:38,255 INFO L93 Difference]: Finished difference Result 533 states and 1492 transitions. [2021-10-11 00:33:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:38,256 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2021-10-11 00:33:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:38,260 INFO L225 Difference]: With dead ends: 533 [2021-10-11 00:33:38,260 INFO L226 Difference]: Without dead ends: 501 [2021-10-11 00:33:38,261 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:33:38,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2021-10-11 00:33:38,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 469. [2021-10-11 00:33:38,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 469 states. [2021-10-11 00:33:38,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1328 transitions. [2021-10-11 00:33:38,281 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1328 transitions. Word has length 15 [2021-10-11 00:33:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:38,281 INFO L481 AbstractCegarLoop]: Abstraction has 469 states and 1328 transitions. [2021-10-11 00:33:38,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:33:38,281 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1328 transitions. [2021-10-11 00:33:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:33:38,283 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:38,283 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:38,283 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:33:38,283 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:38,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash 481901479, now seen corresponding path program 1 times [2021-10-11 00:33:38,284 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:38,284 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084281595] [2021-10-11 00:33:38,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:38,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:38,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:38,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084281595] [2021-10-11 00:33:38,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:38,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:38,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347321900] [2021-10-11 00:33:38,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:33:38,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:38,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:38,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:38,446 INFO L87 Difference]: Start difference. First operand 469 states and 1328 transitions. Second operand 6 states. [2021-10-11 00:33:38,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:38,539 INFO L93 Difference]: Finished difference Result 484 states and 1352 transitions. [2021-10-11 00:33:38,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:38,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2021-10-11 00:33:38,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:38,544 INFO L225 Difference]: With dead ends: 484 [2021-10-11 00:33:38,545 INFO L226 Difference]: Without dead ends: 464 [2021-10-11 00:33:38,545 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:33:38,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2021-10-11 00:33:38,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2021-10-11 00:33:38,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2021-10-11 00:33:38,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 1304 transitions. [2021-10-11 00:33:38,563 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 1304 transitions. Word has length 16 [2021-10-11 00:33:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:38,564 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 1304 transitions. [2021-10-11 00:33:38,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:33:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 1304 transitions. [2021-10-11 00:33:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:33:38,565 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:38,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:38,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:33:38,566 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:38,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:38,566 INFO L82 PathProgramCache]: Analyzing trace with hash 482235907, now seen corresponding path program 1 times [2021-10-11 00:33:38,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:38,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174354018] [2021-10-11 00:33:38,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:38,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:38,713 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174354018] [2021-10-11 00:33:38,713 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:38,713 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:33:38,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147457500] [2021-10-11 00:33:38,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:33:38,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:38,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:33:38,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:33:38,714 INFO L87 Difference]: Start difference. First operand 461 states and 1304 transitions. Second operand 7 states. [2021-10-11 00:33:38,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:38,865 INFO L93 Difference]: Finished difference Result 550 states and 1548 transitions. [2021-10-11 00:33:38,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:33:38,866 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-10-11 00:33:38,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:38,870 INFO L225 Difference]: With dead ends: 550 [2021-10-11 00:33:38,871 INFO L226 Difference]: Without dead ends: 518 [2021-10-11 00:33:38,872 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:33:38,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2021-10-11 00:33:38,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 482. [2021-10-11 00:33:38,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2021-10-11 00:33:38,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1372 transitions. [2021-10-11 00:33:38,890 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1372 transitions. Word has length 16 [2021-10-11 00:33:38,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:38,890 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1372 transitions. [2021-10-11 00:33:38,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:33:38,890 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1372 transitions. [2021-10-11 00:33:38,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:33:38,892 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:38,892 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:38,892 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:33:38,892 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:38,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:38,893 INFO L82 PathProgramCache]: Analyzing trace with hash 492960667, now seen corresponding path program 2 times [2021-10-11 00:33:38,893 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:38,893 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11751724] [2021-10-11 00:33:38,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:39,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:39,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11751724] [2021-10-11 00:33:39,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:39,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:33:39,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478450239] [2021-10-11 00:33:39,045 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 00:33:39,046 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:39,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 00:33:39,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:33:39,046 INFO L87 Difference]: Start difference. First operand 482 states and 1372 transitions. Second operand 7 states. [2021-10-11 00:33:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:39,323 INFO L93 Difference]: Finished difference Result 682 states and 1886 transitions. [2021-10-11 00:33:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 00:33:39,326 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2021-10-11 00:33:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:39,331 INFO L225 Difference]: With dead ends: 682 [2021-10-11 00:33:39,331 INFO L226 Difference]: Without dead ends: 602 [2021-10-11 00:33:39,331 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2021-10-11 00:33:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2021-10-11 00:33:39,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 447. [2021-10-11 00:33:39,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2021-10-11 00:33:39,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 1245 transitions. [2021-10-11 00:33:39,350 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 1245 transitions. Word has length 16 [2021-10-11 00:33:39,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:39,350 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 1245 transitions. [2021-10-11 00:33:39,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 00:33:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 1245 transitions. [2021-10-11 00:33:39,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:33:39,352 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:39,352 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:39,352 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:33:39,353 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:39,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:39,353 INFO L82 PathProgramCache]: Analyzing trace with hash 492530139, now seen corresponding path program 1 times [2021-10-11 00:33:39,353 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:39,354 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351786838] [2021-10-11 00:33:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:39,398 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351786838] [2021-10-11 00:33:39,399 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:39,399 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:39,399 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603610132] [2021-10-11 00:33:39,399 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:39,400 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:39,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:39,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:39,400 INFO L87 Difference]: Start difference. First operand 447 states and 1245 transitions. Second operand 4 states. [2021-10-11 00:33:39,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:39,439 INFO L93 Difference]: Finished difference Result 715 states and 1958 transitions. [2021-10-11 00:33:39,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:39,440 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 00:33:39,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:39,443 INFO L225 Difference]: With dead ends: 715 [2021-10-11 00:33:39,443 INFO L226 Difference]: Without dead ends: 403 [2021-10-11 00:33:39,444 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:39,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2021-10-11 00:33:39,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 379. [2021-10-11 00:33:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2021-10-11 00:33:39,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 982 transitions. [2021-10-11 00:33:39,460 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 982 transitions. Word has length 16 [2021-10-11 00:33:39,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:39,460 INFO L481 AbstractCegarLoop]: Abstraction has 379 states and 982 transitions. [2021-10-11 00:33:39,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:39,461 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 982 transitions. [2021-10-11 00:33:39,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 00:33:39,462 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:39,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:39,462 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:33:39,462 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:39,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:39,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1222661999, now seen corresponding path program 2 times [2021-10-11 00:33:39,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:39,466 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096314125] [2021-10-11 00:33:39,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:39,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:39,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:39,547 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096314125] [2021-10-11 00:33:39,548 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:39,548 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:39,548 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323648732] [2021-10-11 00:33:39,548 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:39,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:39,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:39,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:39,550 INFO L87 Difference]: Start difference. First operand 379 states and 982 transitions. Second operand 4 states. [2021-10-11 00:33:39,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:39,587 INFO L93 Difference]: Finished difference Result 372 states and 855 transitions. [2021-10-11 00:33:39,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:39,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 00:33:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:39,589 INFO L225 Difference]: With dead ends: 372 [2021-10-11 00:33:39,590 INFO L226 Difference]: Without dead ends: 285 [2021-10-11 00:33:39,590 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2021-10-11 00:33:39,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2021-10-11 00:33:39,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2021-10-11 00:33:39,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 650 transitions. [2021-10-11 00:33:39,600 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 650 transitions. Word has length 16 [2021-10-11 00:33:39,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:39,600 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 650 transitions. [2021-10-11 00:33:39,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 650 transitions. [2021-10-11 00:33:39,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 00:33:39,601 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:39,602 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:39,602 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 00:33:39,602 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:39,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:39,603 INFO L82 PathProgramCache]: Analyzing trace with hash 1411500507, now seen corresponding path program 1 times [2021-10-11 00:33:39,603 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:39,603 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962131157] [2021-10-11 00:33:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:39,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:39,666 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962131157] [2021-10-11 00:33:39,666 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:39,666 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:39,666 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275512850] [2021-10-11 00:33:39,667 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:33:39,667 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:39,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:39,668 INFO L87 Difference]: Start difference. First operand 285 states and 650 transitions. Second operand 5 states. [2021-10-11 00:33:39,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:39,719 INFO L93 Difference]: Finished difference Result 233 states and 474 transitions. [2021-10-11 00:33:39,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:39,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-10-11 00:33:39,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:39,722 INFO L225 Difference]: With dead ends: 233 [2021-10-11 00:33:39,722 INFO L226 Difference]: Without dead ends: 185 [2021-10-11 00:33:39,722 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:39,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2021-10-11 00:33:39,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2021-10-11 00:33:39,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2021-10-11 00:33:39,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 368 transitions. [2021-10-11 00:33:39,729 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 368 transitions. Word has length 17 [2021-10-11 00:33:39,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:39,729 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 368 transitions. [2021-10-11 00:33:39,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:33:39,729 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 368 transitions. [2021-10-11 00:33:39,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:33:39,730 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:39,731 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:39,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 00:33:39,731 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:39,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1049838257, now seen corresponding path program 1 times [2021-10-11 00:33:39,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:39,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913441350] [2021-10-11 00:33:39,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:39,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:39,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:39,932 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913441350] [2021-10-11 00:33:39,932 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:39,932 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 00:33:39,932 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273123506] [2021-10-11 00:33:39,933 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 00:33:39,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:39,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 00:33:39,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:33:39,934 INFO L87 Difference]: Start difference. First operand 185 states and 368 transitions. Second operand 9 states. [2021-10-11 00:33:40,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:40,102 INFO L93 Difference]: Finished difference Result 197 states and 381 transitions. [2021-10-11 00:33:40,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:33:40,103 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2021-10-11 00:33:40,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:40,104 INFO L225 Difference]: With dead ends: 197 [2021-10-11 00:33:40,104 INFO L226 Difference]: Without dead ends: 183 [2021-10-11 00:33:40,105 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:33:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-10-11 00:33:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2021-10-11 00:33:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2021-10-11 00:33:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 364 transitions. [2021-10-11 00:33:40,110 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 364 transitions. Word has length 19 [2021-10-11 00:33:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:40,110 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 364 transitions. [2021-10-11 00:33:40,111 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 00:33:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 364 transitions. [2021-10-11 00:33:40,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:33:40,112 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:40,112 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:40,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 00:33:40,112 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash -445266509, now seen corresponding path program 2 times [2021-10-11 00:33:40,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:40,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527076994] [2021-10-11 00:33:40,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:40,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:40,457 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527076994] [2021-10-11 00:33:40,458 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:40,458 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 00:33:40,458 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142867196] [2021-10-11 00:33:40,458 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 00:33:40,459 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:40,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 00:33:40,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-11 00:33:40,460 INFO L87 Difference]: Start difference. First operand 183 states and 364 transitions. Second operand 9 states. [2021-10-11 00:33:40,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:40,639 INFO L93 Difference]: Finished difference Result 198 states and 382 transitions. [2021-10-11 00:33:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-11 00:33:40,639 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2021-10-11 00:33:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:40,641 INFO L225 Difference]: With dead ends: 198 [2021-10-11 00:33:40,641 INFO L226 Difference]: Without dead ends: 182 [2021-10-11 00:33:40,641 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-10-11 00:33:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-11 00:33:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2021-10-11 00:33:40,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2021-10-11 00:33:40,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 362 transitions. [2021-10-11 00:33:40,676 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 362 transitions. Word has length 19 [2021-10-11 00:33:40,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:40,676 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 362 transitions. [2021-10-11 00:33:40,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 00:33:40,677 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 362 transitions. [2021-10-11 00:33:40,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:33:40,677 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:40,678 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:40,678 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-11 00:33:40,678 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:40,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:40,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1706155803, now seen corresponding path program 3 times [2021-10-11 00:33:40,679 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:40,679 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075139793] [2021-10-11 00:33:40,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:40,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:40,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:40,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075139793] [2021-10-11 00:33:40,883 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:40,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 00:33:40,884 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397558735] [2021-10-11 00:33:40,884 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 00:33:40,884 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:40,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 00:33:40,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-11 00:33:40,885 INFO L87 Difference]: Start difference. First operand 182 states and 362 transitions. Second operand 8 states. [2021-10-11 00:33:41,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:41,068 INFO L93 Difference]: Finished difference Result 208 states and 399 transitions. [2021-10-11 00:33:41,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:33:41,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2021-10-11 00:33:41,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:41,070 INFO L225 Difference]: With dead ends: 208 [2021-10-11 00:33:41,070 INFO L226 Difference]: Without dead ends: 145 [2021-10-11 00:33:41,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-10-11 00:33:41,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-11 00:33:41,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2021-10-11 00:33:41,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2021-10-11 00:33:41,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 262 transitions. [2021-10-11 00:33:41,074 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 262 transitions. Word has length 19 [2021-10-11 00:33:41,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:41,074 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 262 transitions. [2021-10-11 00:33:41,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 00:33:41,075 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 262 transitions. [2021-10-11 00:33:41,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-11 00:33:41,075 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:41,075 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:41,076 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-11 00:33:41,076 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:41,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1211997573, now seen corresponding path program 1 times [2021-10-11 00:33:41,077 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:41,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943494926] [2021-10-11 00:33:41,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:41,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:41,157 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943494926] [2021-10-11 00:33:41,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:41,158 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:33:41,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427881864] [2021-10-11 00:33:41,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 00:33:41,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 00:33:41,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 00:33:41,159 INFO L87 Difference]: Start difference. First operand 131 states and 262 transitions. Second operand 6 states. [2021-10-11 00:33:41,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:41,211 INFO L93 Difference]: Finished difference Result 112 states and 223 transitions. [2021-10-11 00:33:41,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 00:33:41,212 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2021-10-11 00:33:41,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:41,212 INFO L225 Difference]: With dead ends: 112 [2021-10-11 00:33:41,212 INFO L226 Difference]: Without dead ends: 63 [2021-10-11 00:33:41,213 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-10-11 00:33:41,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-10-11 00:33:41,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-10-11 00:33:41,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2021-10-11 00:33:41,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 110 transitions. [2021-10-11 00:33:41,215 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 110 transitions. Word has length 19 [2021-10-11 00:33:41,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:41,215 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 110 transitions. [2021-10-11 00:33:41,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 00:33:41,216 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 110 transitions. [2021-10-11 00:33:41,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-11 00:33:41,216 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:41,216 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] [2021-10-11 00:33:41,216 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-11 00:33:41,217 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:41,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:41,217 INFO L82 PathProgramCache]: Analyzing trace with hash 2124764362, now seen corresponding path program 1 times [2021-10-11 00:33:41,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:41,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656996572] [2021-10-11 00:33:41,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:41,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:41,286 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:41,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:41,397 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:41,397 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 00:33:41,397 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-11 00:33:41,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:33:41 BasicIcfg [2021-10-11 00:33:41,535 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:33:41,536 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:33:41,536 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:33:41,536 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:33:41,537 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:21" (3/4) ... [2021-10-11 00:33:41,540 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 00:33:41,652 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d47e3fe8-62e7-48b5-a725-fdb17eaba92c/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:33:41,652 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:33:41,653 INFO L168 Benchmark]: Toolchain (without parser) took 23939.13 ms. Allocated memory was 132.1 MB in the beginning and 390.1 MB in the end (delta: 257.9 MB). Free memory was 95.1 MB in the beginning and 216.1 MB in the end (delta: -121.0 MB). Peak memory consumption was 135.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:41,653 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 132.1 MB. Free memory was 103.9 MB in the beginning and 103.8 MB in the end (delta: 28.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:33:41,654 INFO L168 Benchmark]: CACSL2BoogieTranslator took 725.06 ms. Allocated memory is still 132.1 MB. Free memory was 94.8 MB in the beginning and 82.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:41,654 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.89 ms. Allocated memory is still 132.1 MB. Free memory was 82.4 MB in the beginning and 79.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:41,655 INFO L168 Benchmark]: Boogie Preprocessor took 90.45 ms. Allocated memory is still 132.1 MB. Free memory was 79.6 MB in the beginning and 77.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:41,655 INFO L168 Benchmark]: RCFGBuilder took 2660.93 ms. Allocated memory was 132.1 MB in the beginning and 161.5 MB in the end (delta: 29.4 MB). Free memory was 77.5 MB in the beginning and 73.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 55.3 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:41,656 INFO L168 Benchmark]: TraceAbstraction took 20218.26 ms. Allocated memory was 161.5 MB in the beginning and 390.1 MB in the end (delta: 228.6 MB). Free memory was 73.9 MB in the beginning and 229.7 MB in the end (delta: -155.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:41,656 INFO L168 Benchmark]: Witness Printer took 116.47 ms. Allocated memory is still 390.1 MB. Free memory was 229.7 MB in the beginning and 216.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:41,658 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.29 ms. Allocated memory is still 132.1 MB. Free memory was 103.9 MB in the beginning and 103.8 MB in the end (delta: 28.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 725.06 ms. Allocated memory is still 132.1 MB. Free memory was 94.8 MB in the beginning and 82.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 119.89 ms. Allocated memory is still 132.1 MB. Free memory was 82.4 MB in the beginning and 79.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 90.45 ms. Allocated memory is still 132.1 MB. Free memory was 79.6 MB in the beginning and 77.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2660.93 ms. Allocated memory was 132.1 MB in the beginning and 161.5 MB in the end (delta: 29.4 MB). Free memory was 77.5 MB in the beginning and 73.9 MB in the end (delta: 3.6 MB). Peak memory consumption was 55.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 20218.26 ms. Allocated memory was 161.5 MB in the beginning and 390.1 MB in the end (delta: 228.6 MB). Free memory was 73.9 MB in the beginning and 229.7 MB in the end (delta: -155.8 MB). Peak memory consumption was 73.8 MB. Max. memory is 16.1 GB. * Witness Printer took 116.47 ms. Allocated memory is still 390.1 MB. Free memory was 229.7 MB in the beginning and 216.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1201 VarBasedMoverChecksPositive, 66 VarBasedMoverChecksNegative, 29 SemBasedMoverChecksPositive, 37 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 159 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.9s, 105 PlacesBefore, 37 PlacesAfterwards, 97 TransitionsBefore, 28 TransitionsAfterwards, 1694 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 81 TotalNumberOfCompositions, 4814 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L719] 0 int z = 0; [L720] 0 _Bool z$flush_delayed; [L721] 0 int z$mem_tmp; [L722] 0 _Bool z$r_buff0_thd0; [L723] 0 _Bool z$r_buff0_thd1; [L724] 0 _Bool z$r_buff0_thd2; [L725] 0 _Bool z$r_buff0_thd3; [L726] 0 _Bool z$r_buff1_thd0; [L727] 0 _Bool z$r_buff1_thd1; [L728] 0 _Bool z$r_buff1_thd2; [L729] 0 _Bool z$r_buff1_thd3; [L730] 0 _Bool z$read_delayed; [L731] 0 int *z$read_delayed_var; [L732] 0 int z$w_buff0; [L733] 0 _Bool z$w_buff0_used; [L734] 0 int z$w_buff1; [L735] 0 _Bool z$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t2040; [L819] FCALL, FORK 0 pthread_create(&t2040, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 pthread_t t2041; [L821] FCALL, FORK 0 pthread_create(&t2041, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] 0 pthread_t t2042; [L823] FCALL, FORK 0 pthread_create(&t2042, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 z$w_buff1 = z$w_buff0 [L742] 1 z$w_buff0 = 2 [L743] 1 z$w_buff1_used = z$w_buff0_used [L744] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L746] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L747] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L748] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L749] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L750] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L796] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L796] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L797] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L797] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L798] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L798] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L799] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L800] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L800] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L756] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L760] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L776] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L776] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L777] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L777] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L778] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L779] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L780] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L829] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L829] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L830] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L830] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L831] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L831] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L832] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L833] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L833] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 z$flush_delayed = weak$$choice2 [L839] 0 z$mem_tmp = z [L840] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L840] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L841] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L841] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L842] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L842] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L843] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L843] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L844] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L845] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L845] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L846] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) [L848] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L848] 0 z = z$flush_delayed ? z$mem_tmp : z [L849] 0 z$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 96 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 19.8s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.0s, HoareTripleCheckerStatistics: 592 SDtfs, 642 SDslu, 1386 SDs, 0 SdLazy, 830 SolverSat, 188 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 132 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=974occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 295 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 346 NumberOfCodeBlocks, 346 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 302 ConstructedInterpolants, 0 QuantifiedInterpolants, 41035 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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 incorrect! Received shutdown request...