./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.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-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan --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 32477dfdcd0ead782969359ba837403096eb511b ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 [2020-12-09 10:42:34,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-09 10:42:34,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-09 10:42:34,973 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-09 10:42:34,974 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-09 10:42:34,975 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-09 10:42:34,977 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-09 10:42:34,983 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-09 10:42:34,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-09 10:42:34,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-09 10:42:34,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-09 10:42:34,988 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-09 10:42:34,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-09 10:42:34,990 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-09 10:42:34,991 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-09 10:42:34,992 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-09 10:42:34,993 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-09 10:42:34,994 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-09 10:42:34,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-09 10:42:34,998 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-09 10:42:35,000 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-09 10:42:35,001 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-09 10:42:35,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-09 10:42:35,003 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-09 10:42:35,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-09 10:42:35,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-09 10:42:35,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-09 10:42:35,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-09 10:42:35,009 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-09 10:42:35,010 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-09 10:42:35,010 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-09 10:42:35,011 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-09 10:42:35,012 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-09 10:42:35,013 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-09 10:42:35,014 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-09 10:42:35,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-09 10:42:35,014 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-09 10:42:35,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-09 10:42:35,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-09 10:42:35,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-09 10:42:35,016 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-09 10:42:35,017 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-12-09 10:42:35,039 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-09 10:42:35,039 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-09 10:42:35,040 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-12-09 10:42:35,040 INFO L138 SettingsManager]: * User list type=DISABLED [2020-12-09 10:42:35,040 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-12-09 10:42:35,040 INFO L138 SettingsManager]: * Explicit value domain=true [2020-12-09 10:42:35,040 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-12-09 10:42:35,040 INFO L138 SettingsManager]: * Octagon Domain=false [2020-12-09 10:42:35,041 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-12-09 10:42:35,041 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-12-09 10:42:35,041 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-12-09 10:42:35,041 INFO L138 SettingsManager]: * Interval Domain=false [2020-12-09 10:42:35,041 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-12-09 10:42:35,042 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-12-09 10:42:35,042 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-12-09 10:42:35,042 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-09 10:42:35,042 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-09 10:42:35,042 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-09 10:42:35,042 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-09 10:42:35,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-09 10:42:35,044 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:42:35,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-09 10:42:35,044 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-09 10:42:35,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-12-09 10:42:35,045 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-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(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 -> 32477dfdcd0ead782969359ba837403096eb511b [2020-12-09 10:42:35,216 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-09 10:42:35,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-09 10:42:35,234 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-09 10:42:35,235 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-09 10:42:35,235 INFO L275 PluginConnector]: CDTParser initialized [2020-12-09 10:42:35,236 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i [2020-12-09 10:42:35,277 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/data/4be891484/e638a97b0d3f45afbd6bf2ef83cf32ff/FLAG88b9d422f [2020-12-09 10:42:35,708 INFO L306 CDTParser]: Found 1 translation units. [2020-12-09 10:42:35,708 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i [2020-12-09 10:42:35,721 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/data/4be891484/e638a97b0d3f45afbd6bf2ef83cf32ff/FLAG88b9d422f [2020-12-09 10:42:35,732 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/data/4be891484/e638a97b0d3f45afbd6bf2ef83cf32ff [2020-12-09 10:42:35,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-09 10:42:35,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-09 10:42:35,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-09 10:42:35,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-09 10:42:35,739 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-09 10:42:35,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:42:35" (1/1) ... [2020-12-09 10:42:35,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52dc9edd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:35, skipping insertion in model container [2020-12-09 10:42:35,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:42:35" (1/1) ... [2020-12-09 10:42:35,746 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-09 10:42:35,782 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-09 10:42:35,912 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i[949,962] [2020-12-09 10:42:36,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:42:36,025 INFO L203 MainTranslator]: Completed pre-run [2020-12-09 10:42:36,033 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/sv-benchmarks/c/pthread-wmm/mix006_rmo.oepc.i[949,962] [2020-12-09 10:42:36,070 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-09 10:42:36,120 INFO L208 MainTranslator]: Completed translation [2020-12-09 10:42:36,120 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36 WrapperNode [2020-12-09 10:42:36,120 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-09 10:42:36,121 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-09 10:42:36,121 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-09 10:42:36,121 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-09 10:42:36,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,159 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-09 10:42:36,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-09 10:42:36,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-09 10:42:36,160 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-09 10:42:36,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,172 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,173 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,184 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,188 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,191 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... [2020-12-09 10:42:36,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-09 10:42:36,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-09 10:42:36,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-09 10:42:36,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-09 10:42:36,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-09 10:42:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-09 10:42:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-09 10:42:36,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-09 10:42:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-09 10:42:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-09 10:42:36,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-09 10:42:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-09 10:42:36,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-09 10:42:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-09 10:42:36,262 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-09 10:42:36,262 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-09 10:42:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-09 10:42:36,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-09 10:42:36,263 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-09 10:42:36,269 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-09 10:42:37,674 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-09 10:42:37,675 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2020-12-09 10:42:37,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:37 BoogieIcfgContainer [2020-12-09 10:42:37,677 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-09 10:42:37,678 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-09 10:42:37,678 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-09 10:42:37,681 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-09 10:42:37,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:42:35" (1/3) ... [2020-12-09 10:42:37,681 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e957ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:42:37, skipping insertion in model container [2020-12-09 10:42:37,681 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:42:36" (2/3) ... [2020-12-09 10:42:37,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43e957ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:42:37, skipping insertion in model container [2020-12-09 10:42:37,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:37" (3/3) ... [2020-12-09 10:42:37,683 INFO L111 eAbstractionObserver]: Analyzing ICFG mix006_rmo.oepc.i [2020-12-09 10:42:37,693 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-09 10:42:37,693 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-09 10:42:37,696 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-09 10:42:37,697 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-09 10:42:37,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,725 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,725 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,725 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,725 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,726 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,726 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,730 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,733 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,734 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,735 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,736 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,741 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,742 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,744 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,747 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,748 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,750 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,751 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,752 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,754 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,755 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,756 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,756 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-09 10:42:37,757 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-09 10:42:37,764 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-09 10:42:37,778 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-09 10:42:37,778 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-09 10:42:37,778 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-09 10:42:37,778 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-09 10:42:37,778 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-09 10:42:37,778 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-09 10:42:37,779 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-09 10:42:37,779 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-09 10:42:37,787 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-09 10:42:37,788 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 110 places, 102 transitions, 219 flow [2020-12-09 10:42:37,790 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 110 places, 102 transitions, 219 flow [2020-12-09 10:42:37,792 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 110 places, 102 transitions, 219 flow [2020-12-09 10:42:37,823 INFO L129 PetriNetUnfolder]: 2/99 cut-off events. [2020-12-09 10:42:37,823 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-09 10:42:37,826 INFO L84 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 99 events. 2/99 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 74 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2020-12-09 10:42:37,829 INFO L116 LiptonReduction]: Number of co-enabled transitions 1872 [2020-12-09 10:42:38,066 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 10:42:38,067 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,221 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,222 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,222 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,223 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,226 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,226 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,229 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,229 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,268 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,268 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,269 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,270 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,326 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,327 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,328 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,328 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,330 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,331 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,333 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,334 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,354 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,356 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,356 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,357 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,358 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,360 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,360 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,620 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,620 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,621 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,621 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,623 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,623 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,625 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,625 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,647 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,685 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,686 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,686 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,688 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,688 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,690 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,704 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,705 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,705 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,707 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,707 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,709 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,709 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,861 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,881 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,881 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,882 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,882 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:38,884 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,884 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:38,885 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:38,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:39,419 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:39,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:39,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:39,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:42:39,428 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:39,429 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:39,429 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:39,431 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:39,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:39,432 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:39,433 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:39,433 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:39,434 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:39,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:39,481 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:42:39,483 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:39,483 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:39,517 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-09 10:42:39,517 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:39,572 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,572 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:39,573 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,573 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:39,575 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,575 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:39,577 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,577 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:39,599 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:39,600 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,600 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:39,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:39,604 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:39,604 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:39,888 WARN L197 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-09 10:42:40,243 WARN L197 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 86 [2020-12-09 10:42:40,369 WARN L197 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-12-09 10:42:40,392 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,392 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-09 10:42:40,393 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,394 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,421 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,422 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:40,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:40,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:42:40,423 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:40,423 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:40,424 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:40,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,425 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,426 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,427 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,427 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,477 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,477 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,478 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,478 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,479 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,480 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,480 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,491 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,492 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,492 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,494 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,494 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,518 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,518 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,519 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,520 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,520 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,521 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,521 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,534 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,534 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,535 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,535 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,536 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,536 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,537 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,537 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,626 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,626 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,627 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,628 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,628 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,629 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,629 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,642 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,643 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,643 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,644 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,644 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,645 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,718 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,718 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,719 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:40,719 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:40,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:42:40,720 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:40,720 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:40,721 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:40,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,722 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,722 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,723 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,724 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,724 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,750 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:42:40,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:40,752 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,844 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,844 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,845 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,845 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,846 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,846 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,847 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,847 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,857 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,857 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,859 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,859 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,860 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,935 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,937 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,937 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,948 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,948 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,949 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,950 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,965 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,966 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,966 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,967 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,968 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,968 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-09 10:42:40,978 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,979 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,979 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:40,980 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,980 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:40,981 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:40,981 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:41,072 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:41,073 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-09 10:42:41,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:41,074 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:41,102 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-09 10:42:41,102 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-09 10:42:41,103 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:41,103 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:41,104 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-09 10:42:41,104 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:41,105 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-09 10:42:41,105 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-09 10:42:41,106 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:41,106 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:41,107 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:41,107 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:41,108 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-09 10:42:41,108 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-09 10:42:42,272 WARN L197 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-09 10:42:42,445 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 10:42:42,741 WARN L197 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 118 [2020-12-09 10:42:42,875 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2020-12-09 10:42:42,878 INFO L131 LiptonReduction]: Checked pairs total: 5993 [2020-12-09 10:42:42,879 INFO L133 LiptonReduction]: Total number of compositions: 84 [2020-12-09 10:42:42,882 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2020-12-09 10:42:42,944 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1382 states. [2020-12-09 10:42:42,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1382 states. [2020-12-09 10:42:42,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-09 10:42:42,948 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:42,949 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-09 10:42:42,949 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:42,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:42,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1072770, now seen corresponding path program 1 times [2020-12-09 10:42:42,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:42,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726581663] [2020-12-09 10:42:42,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:43,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:43,098 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726581663] [2020-12-09 10:42:43,099 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:43,099 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-09 10:42:43,099 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783259861] [2020-12-09 10:42:43,102 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-09 10:42:43,102 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:43,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-09 10:42:43,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-09 10:42:43,112 INFO L87 Difference]: Start difference. First operand 1382 states. Second operand 3 states. [2020-12-09 10:42:43,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:43,182 INFO L93 Difference]: Finished difference Result 1152 states and 3742 transitions. [2020-12-09 10:42:43,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-09 10:42:43,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-09 10:42:43,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:43,206 INFO L225 Difference]: With dead ends: 1152 [2020-12-09 10:42:43,207 INFO L226 Difference]: Without dead ends: 972 [2020-12-09 10:42:43,208 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 [2020-12-09 10:42:43,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2020-12-09 10:42:43,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2020-12-09 10:42:43,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 972 states. [2020-12-09 10:42:43,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 3118 transitions. [2020-12-09 10:42:43,289 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 3118 transitions. Word has length 3 [2020-12-09 10:42:43,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:43,289 INFO L481 AbstractCegarLoop]: Abstraction has 972 states and 3118 transitions. [2020-12-09 10:42:43,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-09 10:42:43,289 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 3118 transitions. [2020-12-09 10:42:43,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-12-09 10:42:43,290 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:43,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:43,290 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-09 10:42:43,290 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash 5839260, now seen corresponding path program 1 times [2020-12-09 10:42:43,291 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:43,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585706851] [2020-12-09 10:42:43,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:43,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:43,395 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585706851] [2020-12-09 10:42:43,395 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:43,395 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-09 10:42:43,395 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237198347] [2020-12-09 10:42:43,396 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:42:43,396 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:43,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:42:43,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:42:43,397 INFO L87 Difference]: Start difference. First operand 972 states and 3118 transitions. Second operand 4 states. [2020-12-09 10:42:43,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:43,472 INFO L93 Difference]: Finished difference Result 1774 states and 5394 transitions. [2020-12-09 10:42:43,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:42:43,473 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-12-09 10:42:43,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:43,484 INFO L225 Difference]: With dead ends: 1774 [2020-12-09 10:42:43,484 INFO L226 Difference]: Without dead ends: 1411 [2020-12-09 10:42:43,485 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 [2020-12-09 10:42:43,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-12-09 10:42:43,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 1207. [2020-12-09 10:42:43,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1207 states. [2020-12-09 10:42:43,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1207 states to 1207 states and 3785 transitions. [2020-12-09 10:42:43,520 INFO L78 Accepts]: Start accepts. Automaton has 1207 states and 3785 transitions. Word has length 10 [2020-12-09 10:42:43,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:43,520 INFO L481 AbstractCegarLoop]: Abstraction has 1207 states and 3785 transitions. [2020-12-09 10:42:43,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:42:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand 1207 states and 3785 transitions. [2020-12-09 10:42:43,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-09 10:42:43,522 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:43,522 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:43,523 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-09 10:42:43,523 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:43,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:43,523 INFO L82 PathProgramCache]: Analyzing trace with hash 181028845, now seen corresponding path program 1 times [2020-12-09 10:42:43,523 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:43,523 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855265213] [2020-12-09 10:42:43,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:43,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:43,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:43,595 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855265213] [2020-12-09 10:42:43,595 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:43,595 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:42:43,595 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727682937] [2020-12-09 10:42:43,595 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:42:43,595 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:43,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:42:43,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:42:43,596 INFO L87 Difference]: Start difference. First operand 1207 states and 3785 transitions. Second operand 5 states. [2020-12-09 10:42:43,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:43,677 INFO L93 Difference]: Finished difference Result 1461 states and 4369 transitions. [2020-12-09 10:42:43,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 10:42:43,677 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-12-09 10:42:43,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:43,685 INFO L225 Difference]: With dead ends: 1461 [2020-12-09 10:42:43,685 INFO L226 Difference]: Without dead ends: 1251 [2020-12-09 10:42:43,685 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:42:43,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2020-12-09 10:42:43,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 987. [2020-12-09 10:42:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 987 states. [2020-12-09 10:42:43,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 987 states to 987 states and 3069 transitions. [2020-12-09 10:42:43,712 INFO L78 Accepts]: Start accepts. Automaton has 987 states and 3069 transitions. Word has length 11 [2020-12-09 10:42:43,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:43,712 INFO L481 AbstractCegarLoop]: Abstraction has 987 states and 3069 transitions. [2020-12-09 10:42:43,712 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:42:43,712 INFO L276 IsEmpty]: Start isEmpty. Operand 987 states and 3069 transitions. [2020-12-09 10:42:43,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-12-09 10:42:43,714 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:43,714 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:43,714 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-09 10:42:43,714 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:43,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash 360532264, now seen corresponding path program 1 times [2020-12-09 10:42:43,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:43,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99860262] [2020-12-09 10:42:43,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:43,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:43,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:43,773 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99860262] [2020-12-09 10:42:43,773 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:43,773 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:42:43,773 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99904090] [2020-12-09 10:42:43,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:42:43,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:43,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:42:43,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:42:43,774 INFO L87 Difference]: Start difference. First operand 987 states and 3069 transitions. Second operand 5 states. [2020-12-09 10:42:43,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:43,859 INFO L93 Difference]: Finished difference Result 1267 states and 3751 transitions. [2020-12-09 10:42:43,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 10:42:43,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-12-09 10:42:43,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:43,866 INFO L225 Difference]: With dead ends: 1267 [2020-12-09 10:42:43,866 INFO L226 Difference]: Without dead ends: 1099 [2020-12-09 10:42:43,866 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:42:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1099 states. [2020-12-09 10:42:43,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1099 to 835. [2020-12-09 10:42:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 835 states. [2020-12-09 10:42:43,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 835 states to 835 states and 2563 transitions. [2020-12-09 10:42:43,887 INFO L78 Accepts]: Start accepts. Automaton has 835 states and 2563 transitions. Word has length 12 [2020-12-09 10:42:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:43,888 INFO L481 AbstractCegarLoop]: Abstraction has 835 states and 2563 transitions. [2020-12-09 10:42:43,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:42:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 835 states and 2563 transitions. [2020-12-09 10:42:43,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-12-09 10:42:43,889 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:43,889 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:43,889 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-09 10:42:43,889 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:43,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:43,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1396601717, now seen corresponding path program 1 times [2020-12-09 10:42:43,890 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:43,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249671217] [2020-12-09 10:42:43,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:43,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:43,938 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249671217] [2020-12-09 10:42:43,938 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:43,938 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:42:43,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173695855] [2020-12-09 10:42:43,938 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:42:43,939 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:43,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:42:43,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:42:43,939 INFO L87 Difference]: Start difference. First operand 835 states and 2563 transitions. Second operand 4 states. [2020-12-09 10:42:43,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:43,964 INFO L93 Difference]: Finished difference Result 744 states and 1998 transitions. [2020-12-09 10:42:43,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:42:43,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2020-12-09 10:42:43,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:43,967 INFO L225 Difference]: With dead ends: 744 [2020-12-09 10:42:43,967 INFO L226 Difference]: Without dead ends: 543 [2020-12-09 10:42:43,967 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 [2020-12-09 10:42:43,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2020-12-09 10:42:43,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2020-12-09 10:42:43,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2020-12-09 10:42:43,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 1403 transitions. [2020-12-09 10:42:43,978 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 1403 transitions. Word has length 14 [2020-12-09 10:42:43,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:43,978 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 1403 transitions. [2020-12-09 10:42:43,978 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:42:43,978 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 1403 transitions. [2020-12-09 10:42:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 10:42:43,979 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:43,979 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:43,979 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-09 10:42:43,979 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:43,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:43,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1839821136, now seen corresponding path program 1 times [2020-12-09 10:42:43,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:43,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015630134] [2020-12-09 10:42:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:44,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:44,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:44,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015630134] [2020-12-09 10:42:44,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:44,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 10:42:44,035 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834444960] [2020-12-09 10:42:44,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:42:44,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:44,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:42:44,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:42:44,036 INFO L87 Difference]: Start difference. First operand 543 states and 1403 transitions. Second operand 5 states. [2020-12-09 10:42:44,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:44,069 INFO L93 Difference]: Finished difference Result 807 states and 2032 transitions. [2020-12-09 10:42:44,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-09 10:42:44,069 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 10:42:44,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:44,072 INFO L225 Difference]: With dead ends: 807 [2020-12-09 10:42:44,072 INFO L226 Difference]: Without dead ends: 572 [2020-12-09 10:42:44,072 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 [2020-12-09 10:42:44,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2020-12-09 10:42:44,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 524. [2020-12-09 10:42:44,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2020-12-09 10:42:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 1301 transitions. [2020-12-09 10:42:44,083 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 1301 transitions. Word has length 17 [2020-12-09 10:42:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:44,083 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 1301 transitions. [2020-12-09 10:42:44,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:42:44,083 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 1301 transitions. [2020-12-09 10:42:44,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-12-09 10:42:44,084 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:44,084 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:44,084 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-09 10:42:44,084 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:44,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:44,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1519362420, now seen corresponding path program 1 times [2020-12-09 10:42:44,084 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:44,085 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748369473] [2020-12-09 10:42:44,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:44,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:44,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:44,165 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748369473] [2020-12-09 10:42:44,165 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:44,165 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-09 10:42:44,165 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575111511] [2020-12-09 10:42:44,166 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-09 10:42:44,166 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:44,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-09 10:42:44,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-09 10:42:44,166 INFO L87 Difference]: Start difference. First operand 524 states and 1301 transitions. Second operand 5 states. [2020-12-09 10:42:44,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:44,199 INFO L93 Difference]: Finished difference Result 404 states and 920 transitions. [2020-12-09 10:42:44,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-09 10:42:44,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2020-12-09 10:42:44,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:44,202 INFO L225 Difference]: With dead ends: 404 [2020-12-09 10:42:44,202 INFO L226 Difference]: Without dead ends: 312 [2020-12-09 10:42:44,203 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 [2020-12-09 10:42:44,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-12-09 10:42:44,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 309. [2020-12-09 10:42:44,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2020-12-09 10:42:44,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 691 transitions. [2020-12-09 10:42:44,210 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 691 transitions. Word has length 17 [2020-12-09 10:42:44,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:44,211 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 691 transitions. [2020-12-09 10:42:44,211 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-09 10:42:44,211 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 691 transitions. [2020-12-09 10:42:44,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-12-09 10:42:44,212 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:44,212 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:44,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-09 10:42:44,212 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:44,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:44,212 INFO L82 PathProgramCache]: Analyzing trace with hash -6060473, now seen corresponding path program 1 times [2020-12-09 10:42:44,212 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:44,213 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427848565] [2020-12-09 10:42:44,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:44,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:44,298 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427848565] [2020-12-09 10:42:44,298 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:44,298 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-09 10:42:44,298 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873207238] [2020-12-09 10:42:44,298 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-09 10:42:44,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:44,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-09 10:42:44,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-09 10:42:44,299 INFO L87 Difference]: Start difference. First operand 309 states and 691 transitions. Second operand 6 states. [2020-12-09 10:42:44,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:44,335 INFO L93 Difference]: Finished difference Result 275 states and 623 transitions. [2020-12-09 10:42:44,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-09 10:42:44,335 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-12-09 10:42:44,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:44,336 INFO L225 Difference]: With dead ends: 275 [2020-12-09 10:42:44,336 INFO L226 Difference]: Without dead ends: 172 [2020-12-09 10:42:44,337 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-09 10:42:44,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-12-09 10:42:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 163. [2020-12-09 10:42:44,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2020-12-09 10:42:44,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 368 transitions. [2020-12-09 10:42:44,340 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 368 transitions. Word has length 20 [2020-12-09 10:42:44,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:44,340 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 368 transitions. [2020-12-09 10:42:44,340 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-09 10:42:44,340 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 368 transitions. [2020-12-09 10:42:44,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 10:42:44,340 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:44,340 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:44,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-09 10:42:44,341 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:44,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:44,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1910504912, now seen corresponding path program 1 times [2020-12-09 10:42:44,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:44,341 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452436793] [2020-12-09 10:42:44,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:44,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:44,406 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452436793] [2020-12-09 10:42:44,406 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:44,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-09 10:42:44,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382978038] [2020-12-09 10:42:44,406 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-09 10:42:44,406 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:44,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-09 10:42:44,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-09 10:42:44,407 INFO L87 Difference]: Start difference. First operand 163 states and 368 transitions. Second operand 4 states. [2020-12-09 10:42:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:44,424 INFO L93 Difference]: Finished difference Result 256 states and 572 transitions. [2020-12-09 10:42:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-09 10:42:44,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-12-09 10:42:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:44,425 INFO L225 Difference]: With dead ends: 256 [2020-12-09 10:42:44,425 INFO L226 Difference]: Without dead ends: 121 [2020-12-09 10:42:44,425 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 [2020-12-09 10:42:44,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2020-12-09 10:42:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2020-12-09 10:42:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2020-12-09 10:42:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 256 transitions. [2020-12-09 10:42:44,428 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 256 transitions. Word has length 24 [2020-12-09 10:42:44,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:44,428 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 256 transitions. [2020-12-09 10:42:44,428 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-09 10:42:44,428 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 256 transitions. [2020-12-09 10:42:44,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 10:42:44,428 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:44,428 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:44,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-09 10:42:44,429 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:44,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:44,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1188634270, now seen corresponding path program 2 times [2020-12-09 10:42:44,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:44,429 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731735988] [2020-12-09 10:42:44,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-09 10:42:44,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-09 10:42:44,578 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731735988] [2020-12-09 10:42:44,578 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-09 10:42:44,578 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-09 10:42:44,578 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300692430] [2020-12-09 10:42:44,578 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-09 10:42:44,578 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-12-09 10:42:44,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-09 10:42:44,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-09 10:42:44,579 INFO L87 Difference]: Start difference. First operand 121 states and 256 transitions. Second operand 8 states. [2020-12-09 10:42:44,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-09 10:42:44,752 INFO L93 Difference]: Finished difference Result 142 states and 292 transitions. [2020-12-09 10:42:44,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-09 10:42:44,752 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2020-12-09 10:42:44,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-09 10:42:44,753 INFO L225 Difference]: With dead ends: 142 [2020-12-09 10:42:44,753 INFO L226 Difference]: Without dead ends: 69 [2020-12-09 10:42:44,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-12-09 10:42:44,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-12-09 10:42:44,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2020-12-09 10:42:44,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2020-12-09 10:42:44,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 120 transitions. [2020-12-09 10:42:44,754 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 120 transitions. Word has length 24 [2020-12-09 10:42:44,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-09 10:42:44,755 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 120 transitions. [2020-12-09 10:42:44,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-09 10:42:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 120 transitions. [2020-12-09 10:42:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-12-09 10:42:44,755 INFO L414 BasicCegarLoop]: Found error trace [2020-12-09 10:42:44,755 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-09 10:42:44,755 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-09 10:42:44,755 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-09 10:42:44,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-09 10:42:44,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2137935618, now seen corresponding path program 3 times [2020-12-09 10:42:44,756 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-12-09 10:42:44,756 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074896344] [2020-12-09 10:42:44,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-09 10:42:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:42:44,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:42:44,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-09 10:42:44,845 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-09 10:42:44,871 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-12-09 10:42:44,871 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-09 10:42:44,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-09 10:42:44,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:42:44 BasicIcfg [2020-12-09 10:42:44,933 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-09 10:42:44,933 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-09 10:42:44,933 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-09 10:42:44,933 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-09 10:42:44,933 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:42:37" (3/4) ... [2020-12-09 10:42:44,935 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-09 10:42:44,998 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_e81d3626-442d-4c24-a486-122a3d2066de/bin/utaipan/witness.graphml [2020-12-09 10:42:44,998 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-09 10:42:44,998 INFO L168 Benchmark]: Toolchain (without parser) took 9263.28 ms. Allocated memory was 96.5 MB in the beginning and 268.4 MB in the end (delta: 172.0 MB). Free memory was 61.5 MB in the beginning and 102.3 MB in the end (delta: -40.7 MB). Peak memory consumption was 130.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:42:44,999 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 96.5 MB. Free memory was 75.8 MB in the beginning and 75.8 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-09 10:42:44,999 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.17 ms. Allocated memory is still 96.5 MB. Free memory was 61.3 MB in the beginning and 49.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. [2020-12-09 10:42:44,999 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.18 ms. Allocated memory is still 96.5 MB. Free memory was 49.8 MB in the beginning and 47.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-09 10:42:44,999 INFO L168 Benchmark]: Boogie Preprocessor took 35.01 ms. Allocated memory is still 96.5 MB. Free memory was 47.3 MB in the beginning and 44.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-09 10:42:45,000 INFO L168 Benchmark]: RCFGBuilder took 1481.48 ms. Allocated memory was 96.5 MB in the beginning and 142.6 MB in the end (delta: 46.1 MB). Free memory was 44.8 MB in the beginning and 95.9 MB in the end (delta: -51.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 16.1 GB. [2020-12-09 10:42:45,000 INFO L168 Benchmark]: TraceAbstraction took 7254.71 ms. Allocated memory was 142.6 MB in the beginning and 268.4 MB in the end (delta: 125.8 MB). Free memory was 95.9 MB in the beginning and 120.1 MB in the end (delta: -24.2 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.1 GB. [2020-12-09 10:42:45,000 INFO L168 Benchmark]: Witness Printer took 64.85 ms. Allocated memory is still 268.4 MB. Free memory was 120.1 MB in the beginning and 102.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-12-09 10:42:45,002 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.16 ms. Allocated memory is still 96.5 MB. Free memory was 75.8 MB in the beginning and 75.8 MB in the end (delta: 21.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 384.17 ms. Allocated memory is still 96.5 MB. Free memory was 61.3 MB in the beginning and 49.8 MB in the end (delta: 11.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 38.18 ms. Allocated memory is still 96.5 MB. Free memory was 49.8 MB in the beginning and 47.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 35.01 ms. Allocated memory is still 96.5 MB. Free memory was 47.3 MB in the beginning and 44.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1481.48 ms. Allocated memory was 96.5 MB in the beginning and 142.6 MB in the end (delta: 46.1 MB). Free memory was 44.8 MB in the beginning and 95.9 MB in the end (delta: -51.1 MB). Peak memory consumption was 31.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7254.71 ms. Allocated memory was 142.6 MB in the beginning and 268.4 MB in the end (delta: 125.8 MB). Free memory was 95.9 MB in the beginning and 120.1 MB in the end (delta: -24.2 MB). Peak memory consumption was 101.7 MB. Max. memory is 16.1 GB. * Witness Printer took 64.85 ms. Allocated memory is still 268.4 MB. Free memory was 120.1 MB in the beginning and 102.3 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1263 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 21 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 182 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 5.0s, 110 PlacesBefore, 39 PlacesAfterwards, 102 TransitionsBefore, 30 TransitionsAfterwards, 1872 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 84 TotalNumberOfCompositions, 5993 MoverChecksTotal - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p1_EBX = 0; [L715] 0 int __unbuffered_p2_EAX = 0; [L717] 0 int __unbuffered_p2_EBX = 0; [L718] 0 _Bool main$tmp_guard0; [L719] 0 _Bool main$tmp_guard1; [L721] 0 int x = 0; [L723] 0 int y = 0; [L725] 0 int z = 0; [L726] 0 _Bool z$flush_delayed; [L727] 0 int z$mem_tmp; [L728] 0 _Bool z$r_buff0_thd0; [L729] 0 _Bool z$r_buff0_thd1; [L730] 0 _Bool z$r_buff0_thd2; [L731] 0 _Bool z$r_buff0_thd3; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$read_delayed; [L737] 0 int *z$read_delayed_var; [L738] 0 int z$w_buff0; [L739] 0 _Bool z$w_buff0_used; [L740] 0 int z$w_buff1; [L741] 0 _Bool z$w_buff1_used; [L742] 0 _Bool weak$$choice0; [L743] 0 _Bool weak$$choice2; [L843] 0 pthread_t t165; [L844] FCALL, FORK 0 pthread_create(&t165, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] 0 pthread_t t166; [L846] FCALL, FORK 0 pthread_create(&t166, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 pthread_t t167; [L848] FCALL, FORK 0 pthread_create(&t167, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff1 = z$w_buff0 [L748] 1 z$w_buff0 = 1 [L749] 1 z$w_buff1_used = z$w_buff0_used [L750] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L752] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L753] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L754] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L755] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L756] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L785] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L785] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L786] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L787] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L788] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L789] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L792] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 2 return 0; [L802] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L806] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L807] 3 z$flush_delayed = weak$$choice2 [L808] 3 z$mem_tmp = z [L809] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L809] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L810] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L810] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L810] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L810] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L811] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L811] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L811] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L811] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L812] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L812] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L812] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L812] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L813] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L813] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L814] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L814] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L814] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L815] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L815] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L816] 3 __unbuffered_p2_EBX = z [L817] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L817] 3 z = z$flush_delayed ? z$mem_tmp : z [L818] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L762] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L763] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L764] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L765] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L766] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L821] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L821] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L822] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L822] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L823] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L823] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L824] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L824] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L825] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L825] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L828] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L830] 3 return 0; [L769] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L771] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L854] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L854] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L855] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L855] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L856] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L856] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L857] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L857] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L858] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 101 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 7.0s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 363 SDtfs, 401 SDslu, 671 SDs, 0 SdLazy, 246 SolverSat, 52 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1382occurred 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, 10 MinimizatonAttempts, 792 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 176 NumberOfCodeBlocks, 176 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 15062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...