./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_tso.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_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3a66f9ce6ffd0184430b419e3622dd75c828a1db ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:30:24,453 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:30:24,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:30:24,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:30:24,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:30:24,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:30:24,520 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:30:24,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:30:24,527 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:30:24,535 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:30:24,537 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:30:24,538 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:30:24,538 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:30:24,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:30:24,543 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:30:24,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:30:24,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:30:24,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:30:24,554 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:30:24,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:30:24,561 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:30:24,562 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:30:24,564 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:30:24,565 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:30:24,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:30:24,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:30:24,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:30:24,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:30:24,571 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:30:24,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:30:24,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:30:24,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:30:24,574 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:30:24,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:30:24,577 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:30:24,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:30:24,578 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:30:24,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:30:24,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:30:24,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:30:24,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:30:24,581 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:30:24,603 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:30:24,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:30:24,604 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:30:24,605 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:30:24,605 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:30:24,605 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:30:24,605 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:30:24,606 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:30:24,606 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:30:24,606 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:30:24,606 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:30:24,606 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:30:24,607 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:30:24,607 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:30:24,607 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:30:24,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:30:24,608 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:30:24,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:30:24,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:30:24,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:30:24,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:30:24,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:30:24,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:30:24,610 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:30:24,610 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:30:24,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:30:24,610 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:30:24,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:30:24,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:30:24,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:30:24,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:30:24,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:30:24,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:30:24,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:30:24,612 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:30:24,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:30:24,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:30:24,613 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:30:24,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:30:24,613 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/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_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3a66f9ce6ffd0184430b419e3622dd75c828a1db [2021-10-11 02:30:24,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:30:24,882 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:30:24,885 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:30:24,886 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:30:24,887 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:30:24,888 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i [2021-10-11 02:30:24,972 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/data/08fcb7361/59c0d9c4f7fb4c588df9ed28eb59f9f5/FLAG4a7ddf8ce [2021-10-11 02:30:25,538 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:30:25,541 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i [2021-10-11 02:30:25,558 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/data/08fcb7361/59c0d9c4f7fb4c588df9ed28eb59f9f5/FLAG4a7ddf8ce [2021-10-11 02:30:25,804 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/data/08fcb7361/59c0d9c4f7fb4c588df9ed28eb59f9f5 [2021-10-11 02:30:25,807 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:30:25,809 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:30:25,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:30:25,812 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:30:25,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:30:25,817 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:30:25" (1/1) ... [2021-10-11 02:30:25,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bc01d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:25, skipping insertion in model container [2021-10-11 02:30:25,826 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:30:25" (1/1) ... [2021-10-11 02:30:25,834 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:30:25,910 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:30:26,098 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_95c4f6bc-13c1-4930-9458-28557e106c4b/sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i[991,1004] [2021-10-11 02:30:26,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:30:26,345 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:30:26,357 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_95c4f6bc-13c1-4930-9458-28557e106c4b/sv-benchmarks/c/pthread-wmm/mix000_tso.opt.i[991,1004] [2021-10-11 02:30:26,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:30:26,505 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:30:26,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26 WrapperNode [2021-10-11 02:30:26,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:30:26,509 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:30:26,509 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:30:26,509 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:30:26,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,573 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:30:26,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:30:26,574 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:30:26,574 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:30:26,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,584 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,590 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,613 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... [2021-10-11 02:30:26,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:30:26,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:30:26,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:30:26,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:30:26,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/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 02:30:26,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-11 02:30:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-10-11 02:30:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:30:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:30:26,746 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-10-11 02:30:26,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-10-11 02:30:26,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-10-11 02:30:26,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-10-11 02:30:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:30:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-10-11 02:30:26,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:30:26,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:30:26,752 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-11 02:30:29,260 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:30:29,260 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-10-11 02:30:29,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:29 BoogieIcfgContainer [2021-10-11 02:30:29,263 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:30:29,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:30:29,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:30:29,270 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:30:29,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:30:25" (1/3) ... [2021-10-11 02:30:29,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42552d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:30:29, skipping insertion in model container [2021-10-11 02:30:29,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:30:26" (2/3) ... [2021-10-11 02:30:29,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42552d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:30:29, skipping insertion in model container [2021-10-11 02:30:29,273 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:29" (3/3) ... [2021-10-11 02:30:29,276 INFO L111 eAbstractionObserver]: Analyzing ICFG mix000_tso.opt.i [2021-10-11 02:30:29,294 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-11 02:30:29,295 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:30:29,298 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 02:30:29,299 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-11 02:30:29,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,357 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,357 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,357 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,358 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,358 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,359 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,360 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,361 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,362 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,363 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,364 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,365 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,366 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,367 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,368 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,371 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,372 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,373 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,374 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,375 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,376 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,377 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,378 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,379 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,380 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,381 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,383 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,386 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,387 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,387 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,388 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,388 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,388 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,389 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,389 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,395 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,395 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,396 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,396 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,397 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,398 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,399 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,400 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,401 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,402 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,403 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,404 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,406 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,407 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,408 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,409 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,411 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,412 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,413 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,414 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,417 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,418 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,419 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,420 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,423 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,424 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,424 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,425 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,426 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,430 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,430 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,431 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,432 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,433 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,434 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,436 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,437 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,438 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,438 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,439 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,446 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,447 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-11 02:30:29,453 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-10-11 02:30:29,465 INFO L253 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-10-11 02:30:29,485 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:30:29,485 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:30:29,485 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:30:29,485 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:30:29,486 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:30:29,503 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:30:29,503 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:30:29,503 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:30:29,515 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-11 02:30:29,518 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 89 places, 84 transitions, 178 flow [2021-10-11 02:30:29,521 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 89 places, 84 transitions, 178 flow [2021-10-11 02:30:29,522 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 89 places, 84 transitions, 178 flow [2021-10-11 02:30:29,562 INFO L129 PetriNetUnfolder]: 2/82 cut-off events. [2021-10-11 02:30:29,563 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-10-11 02:30:29,566 INFO L84 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 82 events. 2/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 52 event pairs, 0 based on Foata normal form. 0/78 useless extension candidates. Maximal degree in co-relation 47. Up to 2 conditions per place. [2021-10-11 02:30:29,569 INFO L116 LiptonReduction]: Number of co-enabled transitions 982 [2021-10-11 02:30:31,034 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,035 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,037 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,037 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,041 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,046 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 02:30:31,047 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,089 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,092 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,095 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,096 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,105 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 02:30:31,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,166 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,166 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,168 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,170 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,175 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,176 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,179 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 02:30:31,179 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,216 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,222 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 02:30:31,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:31,444 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:31,444 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:31,450 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:31,451 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:31,456 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:30:31,456 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:31,457 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:31,457 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:31,468 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:31,468 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:31,470 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:31,470 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:31,471 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:31,472 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:31,540 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:31,540 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:30:31,562 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:31,563 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:32,250 WARN L197 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2021-10-11 02:30:32,359 WARN L197 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 59 [2021-10-11 02:30:32,959 WARN L197 SmtUtils]: Spent 599.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2021-10-11 02:30:33,181 WARN L197 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2021-10-11 02:30:33,366 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,369 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:30:33,370 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,371 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:30:33,371 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,387 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,387 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,389 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,389 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,390 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,391 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,395 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,396 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:33,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,404 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:33,410 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,411 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:33,416 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,416 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,419 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,605 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,606 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,607 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,607 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,608 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,608 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,610 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:30:33,610 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,611 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 2, 1] term [2021-10-11 02:30:33,611 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,624 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,630 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,630 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:33,632 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,633 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:33,635 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:33,639 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,640 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2021-10-11 02:30:33,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,778 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:30:33,781 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,781 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:33,866 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:33,871 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:33,871 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:33,872 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:30:33,873 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:33,874 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:33,875 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:33,877 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,877 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,879 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,880 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:33,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:33,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,297 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:34,298 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:34,301 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:34,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:34,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:30:34,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:34,304 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:34,304 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:34,307 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,307 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,309 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,309 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,311 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,365 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:30:34,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,368 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,797 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,797 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,798 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,799 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,799 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,800 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,803 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,803 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,807 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,807 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,808 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,809 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,810 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,810 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,811 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,812 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,818 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,818 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:34,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,820 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:34,822 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,822 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:34,826 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,827 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:34,830 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,830 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:34,832 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,832 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:34,955 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,956 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,970 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,970 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,971 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,972 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,973 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,973 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,974 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,974 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,976 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,976 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:34,982 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,983 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:34,984 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,985 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:34,987 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,988 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:30:34,991 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,991 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:34,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:34,996 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 6, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:34,997 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,144 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2021-10-11 02:30:35,144 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 2, 1] term [2021-10-11 02:30:35,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,146 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 4, 4, 3, 2, 1] term [2021-10-11 02:30:35,147 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,217 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,217 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,219 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,219 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:35,221 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 02:30:35,221 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:35,239 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,241 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,242 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,243 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,244 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 02:30:35,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,275 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,278 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 02:30:35,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,299 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,300 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,300 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,302 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,303 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:35,304 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 02:30:35,305 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:30:35,368 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:35,369 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:30:35,372 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:35,372 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2021-10-11 02:30:35,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:30:35,424 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:35,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:35,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2021-10-11 02:30:35,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:35,428 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2021-10-11 02:30:35,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:30:35,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:35,430 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:35,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,434 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2021-10-11 02:30:35,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2021-10-11 02:30:35,952 WARN L197 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-10-11 02:30:36,141 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2021-10-11 02:30:36,311 WARN L197 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-10-11 02:30:36,416 WARN L197 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-10-11 02:30:36,520 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-10-11 02:30:36,625 WARN L197 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2021-10-11 02:30:37,258 WARN L197 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-10-11 02:30:37,412 WARN L197 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 02:30:37,760 WARN L197 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 112 [2021-10-11 02:30:37,930 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2021-10-11 02:30:37,933 INFO L131 LiptonReduction]: Checked pairs total: 2472 [2021-10-11 02:30:37,934 INFO L133 LiptonReduction]: Total number of compositions: 73 [2021-10-11 02:30:37,939 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 28 places, 22 transitions, 54 flow [2021-10-11 02:30:37,959 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 222 states. [2021-10-11 02:30:37,961 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states. [2021-10-11 02:30:37,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-11 02:30:37,968 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:37,968 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-11 02:30:37,969 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:37,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:37,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1110462809, now seen corresponding path program 1 times [2021-10-11 02:30:37,990 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:37,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071063887] [2021-10-11 02:30:37,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:38,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:38,230 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 02:30:38,230 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071063887] [2021-10-11 02:30:38,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:38,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-11 02:30:38,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193232395] [2021-10-11 02:30:38,236 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:30:38,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:38,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:30:38,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:30:38,261 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 3 states. [2021-10-11 02:30:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:38,347 INFO L93 Difference]: Finished difference Result 192 states and 464 transitions. [2021-10-11 02:30:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:30:38,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2021-10-11 02:30:38,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:38,366 INFO L225 Difference]: With dead ends: 192 [2021-10-11 02:30:38,366 INFO L226 Difference]: Without dead ends: 162 [2021-10-11 02:30:38,367 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 02:30:38,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2021-10-11 02:30:38,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2021-10-11 02:30:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2021-10-11 02:30:38,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 385 transitions. [2021-10-11 02:30:38,444 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 385 transitions. Word has length 5 [2021-10-11 02:30:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:38,445 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 385 transitions. [2021-10-11 02:30:38,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:30:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 385 transitions. [2021-10-11 02:30:38,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-11 02:30:38,446 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:38,446 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:30:38,446 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:30:38,447 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:38,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:38,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1961217474, now seen corresponding path program 1 times [2021-10-11 02:30:38,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:38,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153053952] [2021-10-11 02:30:38,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:38,642 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 02:30:38,643 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153053952] [2021-10-11 02:30:38,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:38,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:30:38,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137308576] [2021-10-11 02:30:38,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:30:38,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:38,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:30:38,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:30:38,647 INFO L87 Difference]: Start difference. First operand 162 states and 385 transitions. Second operand 4 states. [2021-10-11 02:30:38,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:38,708 INFO L93 Difference]: Finished difference Result 184 states and 414 transitions. [2021-10-11 02:30:38,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:30:38,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 8 [2021-10-11 02:30:38,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:38,715 INFO L225 Difference]: With dead ends: 184 [2021-10-11 02:30:38,715 INFO L226 Difference]: Without dead ends: 154 [2021-10-11 02:30:38,715 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 02:30:38,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2021-10-11 02:30:38,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2021-10-11 02:30:38,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2021-10-11 02:30:38,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 361 transitions. [2021-10-11 02:30:38,735 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 361 transitions. Word has length 8 [2021-10-11 02:30:38,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:38,736 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 361 transitions. [2021-10-11 02:30:38,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:30:38,736 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 361 transitions. [2021-10-11 02:30:38,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:30:38,737 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:38,737 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:30:38,737 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:30:38,737 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:38,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:38,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1361352327, now seen corresponding path program 1 times [2021-10-11 02:30:38,737 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:38,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256321992] [2021-10-11 02:30:38,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:38,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:38,800 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 02:30:38,801 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256321992] [2021-10-11 02:30:38,801 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:38,801 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:30:38,802 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606919664] [2021-10-11 02:30:38,802 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:30:38,802 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:38,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:30:38,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:30:38,803 INFO L87 Difference]: Start difference. First operand 154 states and 361 transitions. Second operand 4 states. [2021-10-11 02:30:38,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:38,828 INFO L93 Difference]: Finished difference Result 160 states and 362 transitions. [2021-10-11 02:30:38,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:30:38,830 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2021-10-11 02:30:38,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:38,831 INFO L225 Difference]: With dead ends: 160 [2021-10-11 02:30:38,831 INFO L226 Difference]: Without dead ends: 142 [2021-10-11 02:30:38,832 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 02:30:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-10-11 02:30:38,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-10-11 02:30:38,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2021-10-11 02:30:38,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 329 transitions. [2021-10-11 02:30:38,839 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 329 transitions. Word has length 10 [2021-10-11 02:30:38,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:38,839 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 329 transitions. [2021-10-11 02:30:38,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:30:38,840 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 329 transitions. [2021-10-11 02:30:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:30:38,841 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:38,841 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:30:38,841 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:30:38,841 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:38,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:38,842 INFO L82 PathProgramCache]: Analyzing trace with hash -760485212, now seen corresponding path program 1 times [2021-10-11 02:30:38,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:38,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110209427] [2021-10-11 02:30:38,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:39,087 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 02:30:39,087 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110209427] [2021-10-11 02:30:39,087 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:39,087 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:30:39,088 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456207595] [2021-10-11 02:30:39,088 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:30:39,088 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:39,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:30:39,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:30:39,089 INFO L87 Difference]: Start difference. First operand 142 states and 329 transitions. Second operand 7 states. [2021-10-11 02:30:39,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:39,230 INFO L93 Difference]: Finished difference Result 166 states and 370 transitions. [2021-10-11 02:30:39,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:30:39,231 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2021-10-11 02:30:39,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:39,233 INFO L225 Difference]: With dead ends: 166 [2021-10-11 02:30:39,233 INFO L226 Difference]: Without dead ends: 146 [2021-10-11 02:30:39,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:30:39,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2021-10-11 02:30:39,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2021-10-11 02:30:39,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2021-10-11 02:30:39,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 337 transitions. [2021-10-11 02:30:39,240 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 337 transitions. Word has length 10 [2021-10-11 02:30:39,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:39,240 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 337 transitions. [2021-10-11 02:30:39,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:30:39,240 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 337 transitions. [2021-10-11 02:30:39,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-11 02:30:39,241 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:39,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:30:39,242 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:30:39,242 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:39,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:39,242 INFO L82 PathProgramCache]: Analyzing trace with hash -785509652, now seen corresponding path program 2 times [2021-10-11 02:30:39,243 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:39,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695890958] [2021-10-11 02:30:39,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:39,372 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 02:30:39,372 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695890958] [2021-10-11 02:30:39,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:39,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:30:39,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528975562] [2021-10-11 02:30:39,373 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-10-11 02:30:39,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:39,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-11 02:30:39,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:30:39,374 INFO L87 Difference]: Start difference. First operand 146 states and 337 transitions. Second operand 7 states. [2021-10-11 02:30:39,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:39,496 INFO L93 Difference]: Finished difference Result 162 states and 358 transitions. [2021-10-11 02:30:39,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:30:39,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2021-10-11 02:30:39,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:39,498 INFO L225 Difference]: With dead ends: 162 [2021-10-11 02:30:39,499 INFO L226 Difference]: Without dead ends: 142 [2021-10-11 02:30:39,499 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:30:39,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-10-11 02:30:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 138. [2021-10-11 02:30:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2021-10-11 02:30:39,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 317 transitions. [2021-10-11 02:30:39,504 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 317 transitions. Word has length 10 [2021-10-11 02:30:39,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:39,505 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 317 transitions. [2021-10-11 02:30:39,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2021-10-11 02:30:39,505 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 317 transitions. [2021-10-11 02:30:39,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-11 02:30:39,506 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:39,506 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:30:39,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:30:39,506 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:39,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:39,507 INFO L82 PathProgramCache]: Analyzing trace with hash -2100226897, now seen corresponding path program 1 times [2021-10-11 02:30:39,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:39,507 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500714101] [2021-10-11 02:30:39,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:39,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:39,586 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 02:30:39,586 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500714101] [2021-10-11 02:30:39,586 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:39,586 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:30:39,587 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681426962] [2021-10-11 02:30:39,587 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:30:39,587 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:39,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:30:39,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:30:39,588 INFO L87 Difference]: Start difference. First operand 138 states and 317 transitions. Second operand 5 states. [2021-10-11 02:30:39,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:39,626 INFO L93 Difference]: Finished difference Result 141 states and 313 transitions. [2021-10-11 02:30:39,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:30:39,627 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2021-10-11 02:30:39,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:39,628 INFO L225 Difference]: With dead ends: 141 [2021-10-11 02:30:39,628 INFO L226 Difference]: Without dead ends: 126 [2021-10-11 02:30:39,629 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 02:30:39,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-10-11 02:30:39,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2021-10-11 02:30:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2021-10-11 02:30:39,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 285 transitions. [2021-10-11 02:30:39,633 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 285 transitions. Word has length 11 [2021-10-11 02:30:39,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:39,634 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 285 transitions. [2021-10-11 02:30:39,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:30:39,634 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 285 transitions. [2021-10-11 02:30:39,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:30:39,635 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:39,635 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:30:39,635 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:30:39,636 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:39,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:39,636 INFO L82 PathProgramCache]: Analyzing trace with hash -1705273815, now seen corresponding path program 1 times [2021-10-11 02:30:39,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:39,637 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407418888] [2021-10-11 02:30:39,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:39,731 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 02:30:39,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407418888] [2021-10-11 02:30:39,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:39,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:30:39,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315052118] [2021-10-11 02:30:39,732 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:30:39,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:39,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:30:39,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:30:39,733 INFO L87 Difference]: Start difference. First operand 126 states and 285 transitions. Second operand 4 states. [2021-10-11 02:30:39,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:39,777 INFO L93 Difference]: Finished difference Result 104 states and 198 transitions. [2021-10-11 02:30:39,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:30:39,777 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2021-10-11 02:30:39,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:39,778 INFO L225 Difference]: With dead ends: 104 [2021-10-11 02:30:39,778 INFO L226 Difference]: Without dead ends: 74 [2021-10-11 02:30:39,779 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 02:30:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-10-11 02:30:39,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2021-10-11 02:30:39,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-10-11 02:30:39,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 129 transitions. [2021-10-11 02:30:39,782 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 129 transitions. Word has length 12 [2021-10-11 02:30:39,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:39,783 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 129 transitions. [2021-10-11 02:30:39,783 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:30:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 129 transitions. [2021-10-11 02:30:39,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-11 02:30:39,784 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:39,784 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:30:39,784 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:30:39,785 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:39,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:39,785 INFO L82 PathProgramCache]: Analyzing trace with hash 179906185, now seen corresponding path program 1 times [2021-10-11 02:30:39,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:39,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193164443] [2021-10-11 02:30:39,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:39,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:39,929 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 02:30:39,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193164443] [2021-10-11 02:30:39,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:39,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:30:39,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977503444] [2021-10-11 02:30:39,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:30:39,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:39,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:30:39,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:30:39,931 INFO L87 Difference]: Start difference. First operand 74 states and 129 transitions. Second operand 5 states. [2021-10-11 02:30:39,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:39,967 INFO L93 Difference]: Finished difference Result 56 states and 91 transitions. [2021-10-11 02:30:39,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:30:39,968 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2021-10-11 02:30:39,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:39,969 INFO L225 Difference]: With dead ends: 56 [2021-10-11 02:30:39,969 INFO L226 Difference]: Without dead ends: 46 [2021-10-11 02:30:39,969 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 02:30:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-10-11 02:30:39,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2021-10-11 02:30:39,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2021-10-11 02:30:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2021-10-11 02:30:39,972 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 73 transitions. Word has length 14 [2021-10-11 02:30:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:39,972 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 73 transitions. [2021-10-11 02:30:39,972 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:30:39,972 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 73 transitions. [2021-10-11 02:30:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:30:39,973 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:39,973 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 02:30:39,973 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:30:39,973 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:39,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1600545873, now seen corresponding path program 1 times [2021-10-11 02:30:39,974 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:39,974 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359414143] [2021-10-11 02:30:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:40,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:40,102 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 02:30:40,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359414143] [2021-10-11 02:30:40,103 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:40,103 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:30:40,103 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450972188] [2021-10-11 02:30:40,104 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:30:40,104 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:40,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:30:40,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:30:40,105 INFO L87 Difference]: Start difference. First operand 46 states and 73 transitions. Second operand 5 states. [2021-10-11 02:30:40,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:40,169 INFO L93 Difference]: Finished difference Result 61 states and 93 transitions. [2021-10-11 02:30:40,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 02:30:40,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2021-10-11 02:30:40,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:40,170 INFO L225 Difference]: With dead ends: 61 [2021-10-11 02:30:40,170 INFO L226 Difference]: Without dead ends: 42 [2021-10-11 02:30:40,171 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:30:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-10-11 02:30:40,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2021-10-11 02:30:40,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2021-10-11 02:30:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2021-10-11 02:30:40,173 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 17 [2021-10-11 02:30:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:40,173 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2021-10-11 02:30:40,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:30:40,173 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2021-10-11 02:30:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:30:40,174 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:40,174 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 02:30:40,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:30:40,174 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:40,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1501811857, now seen corresponding path program 2 times [2021-10-11 02:30:40,175 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:40,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740302755] [2021-10-11 02:30:40,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:40,472 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 02:30:40,473 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740302755] [2021-10-11 02:30:40,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:40,473 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-11 02:30:40,473 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434520061] [2021-10-11 02:30:40,474 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-10-11 02:30:40,474 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-11 02:30:40,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:30:40,475 INFO L87 Difference]: Start difference. First operand 36 states and 53 transitions. Second operand 9 states. [2021-10-11 02:30:40,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:40,687 INFO L93 Difference]: Finished difference Result 70 states and 99 transitions. [2021-10-11 02:30:40,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-11 02:30:40,688 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2021-10-11 02:30:40,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:40,688 INFO L225 Difference]: With dead ends: 70 [2021-10-11 02:30:40,688 INFO L226 Difference]: Without dead ends: 26 [2021-10-11 02:30:40,689 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:30:40,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-11 02:30:40,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-11 02:30:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2021-10-11 02:30:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2021-10-11 02:30:40,690 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 17 [2021-10-11 02:30:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:40,690 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2021-10-11 02:30:40,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2021-10-11 02:30:40,691 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2021-10-11 02:30:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:30:40,691 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:40,691 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 02:30:40,691 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:30:40,691 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:40,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:40,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1513614481, now seen corresponding path program 3 times [2021-10-11 02:30:40,692 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:40,692 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736652496] [2021-10-11 02:30:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:40,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:30:41,009 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 02:30:41,010 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1736652496] [2021-10-11 02:30:41,010 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:30:41,010 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:30:41,010 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793932396] [2021-10-11 02:30:41,011 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:30:41,011 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:30:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:30:41,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:30:41,013 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 8 states. [2021-10-11 02:30:41,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:30:41,200 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2021-10-11 02:30:41,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:30:41,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2021-10-11 02:30:41,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:30:41,209 INFO L225 Difference]: With dead ends: 33 [2021-10-11 02:30:41,209 INFO L226 Difference]: Without dead ends: 20 [2021-10-11 02:30:41,209 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:30:41,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-11 02:30:41,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-11 02:30:41,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2021-10-11 02:30:41,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-10-11 02:30:41,213 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2021-10-11 02:30:41,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:30:41,213 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-10-11 02:30:41,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:30:41,214 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-10-11 02:30:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:30:41,214 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:30:41,214 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 02:30:41,214 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:30:41,215 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:30:41,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:30:41,215 INFO L82 PathProgramCache]: Analyzing trace with hash 2137662347, now seen corresponding path program 4 times [2021-10-11 02:30:41,215 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:30:41,216 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155484265] [2021-10-11 02:30:41,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:30:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:30:41,280 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:30:41,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:30:41,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:30:41,391 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:30:41,391 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:30:41,392 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:30:41,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:30:41 BasicIcfg [2021-10-11 02:30:41,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:30:41,500 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:30:41,500 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:30:41,500 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:30:41,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:30:29" (3/4) ... [2021-10-11 02:30:41,502 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:30:41,597 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_95c4f6bc-13c1-4930-9458-28557e106c4b/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:30:41,597 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:30:41,598 INFO L168 Benchmark]: Toolchain (without parser) took 15789.11 ms. Allocated memory was 125.8 MB in the beginning and 314.6 MB in the end (delta: 188.7 MB). Free memory was 87.0 MB in the beginning and 115.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 160.0 MB. Max. memory is 16.1 GB. [2021-10-11 02:30:41,598 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 125.8 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:30:41,599 INFO L168 Benchmark]: CACSL2BoogieTranslator took 695.90 ms. Allocated memory is still 125.8 MB. Free memory was 86.9 MB in the beginning and 75.3 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:30:41,599 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.93 ms. Allocated memory is still 125.8 MB. Free memory was 75.3 MB in the beginning and 72.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 02:30:41,600 INFO L168 Benchmark]: Boogie Preprocessor took 49.62 ms. Allocated memory is still 125.8 MB. Free memory was 72.3 MB in the beginning and 70.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:30:41,600 INFO L168 Benchmark]: RCFGBuilder took 2639.05 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 70.2 MB in the beginning and 71.0 MB in the end (delta: -770.3 kB). Peak memory consumption was 50.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:30:41,600 INFO L168 Benchmark]: TraceAbstraction took 12233.84 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 70.0 MB in the beginning and 127.9 MB in the end (delta: -57.9 MB). Peak memory consumption was 105.7 MB. Max. memory is 16.1 GB. [2021-10-11 02:30:41,601 INFO L168 Benchmark]: Witness Printer took 96.88 ms. Allocated memory is still 314.6 MB. Free memory was 127.9 MB in the beginning and 115.3 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:30:41,603 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.28 ms. Allocated memory is still 125.8 MB. Free memory is still 105.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 695.90 ms. Allocated memory is still 125.8 MB. Free memory was 86.9 MB in the beginning and 75.3 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.93 ms. Allocated memory is still 125.8 MB. Free memory was 75.3 MB in the beginning and 72.3 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.62 ms. Allocated memory is still 125.8 MB. Free memory was 72.3 MB in the beginning and 70.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2639.05 ms. Allocated memory was 125.8 MB in the beginning and 151.0 MB in the end (delta: 25.2 MB). Free memory was 70.2 MB in the beginning and 71.0 MB in the end (delta: -770.3 kB). Peak memory consumption was 50.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 12233.84 ms. Allocated memory was 151.0 MB in the beginning and 314.6 MB in the end (delta: 163.6 MB). Free memory was 70.0 MB in the beginning and 127.9 MB in the end (delta: -57.9 MB). Peak memory consumption was 105.7 MB. Max. memory is 16.1 GB. * Witness Printer took 96.88 ms. Allocated memory is still 314.6 MB. Free memory was 127.9 MB in the beginning and 115.3 MB in the end (delta: 12.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 615 VarBasedMoverChecksPositive, 41 VarBasedMoverChecksNegative, 11 SemBasedMoverChecksPositive, 30 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 67 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.4s, 89 PlacesBefore, 28 PlacesAfterwards, 84 TransitionsBefore, 22 TransitionsAfterwards, 982 CoEnabledTransitionPairs, 6 FixpointIterations, 35 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 73 TotalNumberOfCompositions, 2472 MoverChecksTotal - CounterExampleResult [Line: 19]: 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L722] 0 _Bool x$flush_delayed; [L723] 0 int x$mem_tmp; [L724] 0 _Bool x$r_buff0_thd0; [L725] 0 _Bool x$r_buff0_thd1; [L726] 0 _Bool x$r_buff0_thd2; [L727] 0 _Bool x$r_buff1_thd0; [L728] 0 _Bool x$r_buff1_thd1; [L729] 0 _Bool x$r_buff1_thd2; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L826] 0 pthread_t t12; [L827] FCALL, FORK 0 pthread_create(&t12, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L828] 0 pthread_t t13; [L829] FCALL, FORK 0 pthread_create(&t13, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 1 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L19] COND FALSE 2 !(!expression) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L785] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 2 x$flush_delayed = weak$$choice2 [L788] 2 x$mem_tmp = x [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1 [L789] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L789] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L790] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L790] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L791] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L791] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L792] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L792] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L793] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L794] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L795] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L795] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L796] 2 __unbuffered_p1_EAX = x [L797] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L797] 2 x = x$flush_delayed ? x$mem_tmp : x [L798] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L801] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L743] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L746] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L749] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L750] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L751] 1 x$flush_delayed = weak$$choice2 [L752] 1 x$mem_tmp = x [L753] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L753] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L754] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L754] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L755] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L755] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L756] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L756] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L757] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L758] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L759] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L759] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L760] 1 __unbuffered_p0_EBX = x [L761] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L761] 1 x = x$flush_delayed ? x$mem_tmp : x [L762] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L804] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L805] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L805] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L806] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L806] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L807] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L808] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L808] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L811] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L813] 2 return 0; [L831] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L4] COND FALSE 0 !(!cond) [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L835] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L835] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L836] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L836] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L837] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L837] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L838] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L838] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L839] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L839] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L842] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 83 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 11.9s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.4s, HoareTripleCheckerStatistics: 230 SDtfs, 239 SDslu, 498 SDs, 0 SdLazy, 300 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=222occurred 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.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 148 NumberOfCodeBlocks, 148 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 120 ConstructedInterpolants, 0 QuantifiedInterpolants, 11928 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...