./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/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 25a848dab1dbb076c6626548617ae5774f227259 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-a4ecdab [2020-11-28 07:29:29,985 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 07:29:30,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 07:29:30,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 07:29:30,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 07:29:30,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 07:29:30,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 07:29:30,111 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 07:29:30,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 07:29:30,121 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 07:29:30,122 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 07:29:30,125 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 07:29:30,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 07:29:30,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 07:29:30,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 07:29:30,134 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 07:29:30,136 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 07:29:30,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 07:29:30,144 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 07:29:30,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 07:29:30,155 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 07:29:30,157 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 07:29:30,159 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 07:29:30,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 07:29:30,171 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 07:29:30,172 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 07:29:30,173 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 07:29:30,175 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 07:29:30,176 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 07:29:30,178 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 07:29:30,178 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 07:29:30,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 07:29:30,182 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 07:29:30,184 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 07:29:30,186 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 07:29:30,186 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 07:29:30,187 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 07:29:30,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 07:29:30,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 07:29:30,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 07:29:30,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 07:29:30,193 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2020-11-28 07:29:30,242 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 07:29:30,243 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 07:29:30,244 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2020-11-28 07:29:30,245 INFO L138 SettingsManager]: * User list type=DISABLED [2020-11-28 07:29:30,245 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2020-11-28 07:29:30,245 INFO L138 SettingsManager]: * Explicit value domain=true [2020-11-28 07:29:30,246 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2020-11-28 07:29:30,246 INFO L138 SettingsManager]: * Octagon Domain=false [2020-11-28 07:29:30,246 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2020-11-28 07:29:30,246 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2020-11-28 07:29:30,248 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2020-11-28 07:29:30,248 INFO L138 SettingsManager]: * Interval Domain=false [2020-11-28 07:29:30,249 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2020-11-28 07:29:30,249 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2020-11-28 07:29:30,249 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2020-11-28 07:29:30,250 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 07:29:30,251 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 07:29:30,251 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 07:29:30,251 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 07:29:30,251 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 07:29:30,252 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 07:29:30,252 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 07:29:30,252 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 07:29:30,253 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-11-28 07:29:30,253 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 07:29:30,253 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 07:29:30,253 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 07:29:30,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 07:29:30,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 07:29:30,254 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 07:29:30,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 07:29:30,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 07:29:30,256 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 07:29:30,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 07:29:30,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 07:29:30,257 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2020-11-28 07:29:30,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 07:29:30,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 07:29:30,257 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 07:29:30,258 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-11-28 07:29:30,258 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_ab60fb48-22ca-4bef-b4fc-b8704290e10a/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_ab60fb48-22ca-4bef-b4fc-b8704290e10a/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 -> 25a848dab1dbb076c6626548617ae5774f227259 [2020-11-28 07:29:30,609 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 07:29:30,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 07:29:30,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 07:29:30,641 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 07:29:30,642 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 07:29:30,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i [2020-11-28 07:29:30,722 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/data/123badb6f/cd4921fd119d42de87404e7741eb2b54/FLAGa781b0b9a [2020-11-28 07:29:31,410 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 07:29:31,411 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/sv-benchmarks/c/pthread-wmm/mix033_pso.opt.i [2020-11-28 07:29:31,444 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/data/123badb6f/cd4921fd119d42de87404e7741eb2b54/FLAGa781b0b9a [2020-11-28 07:29:31,640 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/data/123badb6f/cd4921fd119d42de87404e7741eb2b54 [2020-11-28 07:29:31,642 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 07:29:31,644 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 07:29:31,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 07:29:31,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 07:29:31,650 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 07:29:31,651 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:29:31" (1/1) ... [2020-11-28 07:29:31,654 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72e15fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:31, skipping insertion in model container [2020-11-28 07:29:31,654 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 07:29:31" (1/1) ... [2020-11-28 07:29:31,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 07:29:31,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 07:29:32,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:29:32,290 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 07:29:32,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 07:29:32,488 INFO L208 MainTranslator]: Completed translation [2020-11-28 07:29:32,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32 WrapperNode [2020-11-28 07:29:32,489 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 07:29:32,491 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 07:29:32,491 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 07:29:32,491 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 07:29:32,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,565 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 07:29:32,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 07:29:32,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 07:29:32,610 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 07:29:32,622 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,622 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,650 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,656 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... [2020-11-28 07:29:32,688 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 07:29:32,689 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 07:29:32,689 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 07:29:32,689 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 07:29:32,691 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/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-11-28 07:29:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-28 07:29:32,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-28 07:29:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 07:29:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-28 07:29:32,775 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-28 07:29:32,775 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-28 07:29:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-28 07:29:32,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-28 07:29:32,776 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-28 07:29:32,776 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-28 07:29:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 07:29:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-28 07:29:32,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 07:29:32,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 07:29:32,780 WARN L208 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-28 07:29:35,789 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 07:29:35,789 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-28 07:29:35,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:29:35 BoogieIcfgContainer [2020-11-28 07:29:35,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 07:29:35,794 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 07:29:35,794 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 07:29:35,800 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 07:29:35,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 07:29:31" (1/3) ... [2020-11-28 07:29:35,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ffce0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:29:35, skipping insertion in model container [2020-11-28 07:29:35,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 07:29:32" (2/3) ... [2020-11-28 07:29:35,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17ffce0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 07:29:35, skipping insertion in model container [2020-11-28 07:29:35,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:29:35" (3/3) ... [2020-11-28 07:29:35,804 INFO L111 eAbstractionObserver]: Analyzing ICFG mix033_pso.opt.i [2020-11-28 07:29:35,823 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-28 07:29:35,823 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 07:29:35,829 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 07:29:35,830 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-28 07:29:35,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,886 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,886 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,887 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,887 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,888 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,888 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,889 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,889 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,890 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,891 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,892 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,893 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,894 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,895 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,896 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,897 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,898 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,899 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,900 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,901 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,904 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,906 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,907 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,908 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,908 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,909 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,909 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,910 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,911 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,912 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,913 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,916 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,917 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,917 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,917 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,920 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,921 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,922 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,922 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,923 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,924 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,924 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,925 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,930 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,930 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,930 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,931 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,931 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,932 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-28 07:29:35,935 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-28 07:29:35,950 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-28 07:29:35,990 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 07:29:35,992 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 07:29:35,993 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 07:29:35,993 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 07:29:35,993 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 07:29:35,993 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 07:29:35,993 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 07:29:35,994 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 07:29:36,016 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-28 07:29:36,019 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 115 places, 108 transitions, 231 flow [2020-11-28 07:29:36,023 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 115 places, 108 transitions, 231 flow [2020-11-28 07:29:36,026 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 115 places, 108 transitions, 231 flow [2020-11-28 07:29:36,108 INFO L129 PetriNetUnfolder]: 3/105 cut-off events. [2020-11-28 07:29:36,108 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-28 07:29:36,116 INFO L80 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 3/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 78 event pairs, 0 based on Foata normal form. 0/100 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2020-11-28 07:29:36,122 INFO L116 LiptonReduction]: Number of co-enabled transitions 2024 [2020-11-28 07:29:36,573 WARN L193 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2020-11-28 07:29:37,110 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:37,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:29:37,115 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:29:37,116 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:37,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:37,181 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:37,185 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:37,186 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:37,190 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:37,190 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:37,197 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:37,198 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:37,201 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:29:37,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:37,207 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:37,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:37,215 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:37,216 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:37,343 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:37,343 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:37,344 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:37,345 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:37,348 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:37,348 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:37,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:37,351 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:37,384 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:37,384 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:37,385 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:37,386 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:37,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:37,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:37,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:37,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:37,976 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-28 07:29:38,122 WARN L193 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2020-11-28 07:29:38,720 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 07:29:38,835 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-28 07:29:39,012 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:39,013 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:39,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:39,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:39,021 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,021 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:39,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:29:39,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,043 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,043 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,114 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,115 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:29:39,118 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:29:39,118 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,293 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-28 07:29:39,294 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:39,893 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:39,894 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:39,895 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:39,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:39,897 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:39,898 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:39,900 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:39,900 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:39,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:39,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:39,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:39,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:39,921 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:39,921 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:39,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,979 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:39,980 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:39,982 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:39,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:39,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,988 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:39,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:29:39,990 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,993 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,994 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:39,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:39,996 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:29:40,087 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:29:40,088 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,249 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-11-28 07:29:40,252 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:29:40,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:40,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,321 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,322 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:40,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,324 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:40,326 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,326 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:40,328 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:29:40,329 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,331 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,331 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,333 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,333 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,404 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:29:40,405 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,406 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,407 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,408 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:40,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,437 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,437 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,439 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,440 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,441 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:40,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,462 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,465 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:40,468 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:40,468 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:40,616 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:40,617 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,618 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,618 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:40,623 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:40,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:40,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,647 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,649 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,650 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:40,651 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,704 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:40,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,721 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:40,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:40,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:40,738 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:29:40,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,740 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,742 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:40,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 07:29:40,795 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:29:40,796 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:40,973 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:40,973 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-28 07:29:40,975 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-28 07:29:40,976 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:41,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:41,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:41,016 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:41,016 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:41,018 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:41,018 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:41,019 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-28 07:29:41,019 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-28 07:29:41,022 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-28 07:29:41,023 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:41,024 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:41,024 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:41,026 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-11-28 07:29:41,027 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:41,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:41,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:41,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:41,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:41,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:41,084 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:41,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:41,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-28 07:29:41,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:41,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:41,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:41,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-28 07:29:41,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-28 07:29:41,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:41,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-28 07:29:41,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-28 07:29:41,582 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-28 07:29:41,697 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2020-11-28 07:29:41,881 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 42 [2020-11-28 07:29:42,183 WARN L193 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2020-11-28 07:29:42,287 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2020-11-28 07:29:43,023 WARN L193 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 122 [2020-11-28 07:29:43,307 WARN L193 SmtUtils]: Spent 281.00 ms on a formula simplification that was a NOOP. DAG size: 118 [2020-11-28 07:29:43,456 INFO L131 LiptonReduction]: Checked pairs total: 4880 [2020-11-28 07:29:43,456 INFO L133 LiptonReduction]: Total number of compositions: 98 [2020-11-28 07:29:43,465 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-11-28 07:29:43,547 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 750 states. [2020-11-28 07:29:43,549 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states. [2020-11-28 07:29:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-11-28 07:29:43,558 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:43,559 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:43,560 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:43,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1080882322, now seen corresponding path program 1 times [2020-11-28 07:29:43,579 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:43,581 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613412878] [2020-11-28 07:29:43,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:43,966 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613412878] [2020-11-28 07:29:43,966 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:43,967 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:29:43,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832612017] [2020-11-28 07:29:43,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:29:43,973 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:43,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:29:43,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:29:43,989 INFO L87 Difference]: Start difference. First operand 750 states. Second operand 3 states. [2020-11-28 07:29:44,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:44,150 INFO L93 Difference]: Finished difference Result 650 states and 2028 transitions. [2020-11-28 07:29:44,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:29:44,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-11-28 07:29:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:44,181 INFO L225 Difference]: With dead ends: 650 [2020-11-28 07:29:44,181 INFO L226 Difference]: Without dead ends: 530 [2020-11-28 07:29:44,182 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-11-28 07:29:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2020-11-28 07:29:44,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2020-11-28 07:29:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2020-11-28 07:29:44,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1622 transitions. [2020-11-28 07:29:44,320 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1622 transitions. Word has length 7 [2020-11-28 07:29:44,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:44,321 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 1622 transitions. [2020-11-28 07:29:44,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:29:44,322 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1622 transitions. [2020-11-28 07:29:44,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-11-28 07:29:44,325 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:44,325 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:44,325 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 07:29:44,326 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:44,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:44,331 INFO L82 PathProgramCache]: Analyzing trace with hash -654110915, now seen corresponding path program 1 times [2020-11-28 07:29:44,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:44,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084713800] [2020-11-28 07:29:44,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:44,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:44,443 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084713800] [2020-11-28 07:29:44,443 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:44,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:29:44,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346332860] [2020-11-28 07:29:44,445 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:29:44,446 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:44,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:29:44,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:29:44,447 INFO L87 Difference]: Start difference. First operand 530 states and 1622 transitions. Second operand 3 states. [2020-11-28 07:29:44,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:44,481 INFO L93 Difference]: Finished difference Result 482 states and 1450 transitions. [2020-11-28 07:29:44,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:29:44,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-11-28 07:29:44,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:44,492 INFO L225 Difference]: With dead ends: 482 [2020-11-28 07:29:44,492 INFO L226 Difference]: Without dead ends: 482 [2020-11-28 07:29:44,493 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-11-28 07:29:44,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2020-11-28 07:29:44,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 482. [2020-11-28 07:29:44,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 482 states. [2020-11-28 07:29:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 482 states to 482 states and 1450 transitions. [2020-11-28 07:29:44,553 INFO L78 Accepts]: Start accepts. Automaton has 482 states and 1450 transitions. Word has length 9 [2020-11-28 07:29:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:44,553 INFO L481 AbstractCegarLoop]: Abstraction has 482 states and 1450 transitions. [2020-11-28 07:29:44,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:29:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 482 states and 1450 transitions. [2020-11-28 07:29:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-11-28 07:29:44,556 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:44,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:44,557 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 07:29:44,557 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:44,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash 323102118, now seen corresponding path program 1 times [2020-11-28 07:29:44,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:44,558 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187723696] [2020-11-28 07:29:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:44,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:44,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:44,694 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187723696] [2020-11-28 07:29:44,694 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:44,694 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-28 07:29:44,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472408258] [2020-11-28 07:29:44,694 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:29:44,695 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:44,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:29:44,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:29:44,695 INFO L87 Difference]: Start difference. First operand 482 states and 1450 transitions. Second operand 3 states. [2020-11-28 07:29:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:44,722 INFO L93 Difference]: Finished difference Result 458 states and 1368 transitions. [2020-11-28 07:29:44,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:29:44,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-11-28 07:29:44,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:44,728 INFO L225 Difference]: With dead ends: 458 [2020-11-28 07:29:44,728 INFO L226 Difference]: Without dead ends: 458 [2020-11-28 07:29:44,728 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-11-28 07:29:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2020-11-28 07:29:44,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2020-11-28 07:29:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2020-11-28 07:29:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 1368 transitions. [2020-11-28 07:29:44,751 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 1368 transitions. Word has length 11 [2020-11-28 07:29:44,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:44,752 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 1368 transitions. [2020-11-28 07:29:44,752 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:29:44,752 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 1368 transitions. [2020-11-28 07:29:44,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-28 07:29:44,756 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:44,756 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:44,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 07:29:44,756 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:44,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:44,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1229959684, now seen corresponding path program 1 times [2020-11-28 07:29:44,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:44,758 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888951677] [2020-11-28 07:29:44,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:44,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:44,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:44,918 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888951677] [2020-11-28 07:29:44,918 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:44,918 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:29:44,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140147894] [2020-11-28 07:29:44,919 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:29:44,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:44,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:29:44,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:29:44,920 INFO L87 Difference]: Start difference. First operand 458 states and 1368 transitions. Second operand 4 states. [2020-11-28 07:29:45,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:45,001 INFO L93 Difference]: Finished difference Result 440 states and 1162 transitions. [2020-11-28 07:29:45,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 07:29:45,002 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-28 07:29:45,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:45,006 INFO L225 Difference]: With dead ends: 440 [2020-11-28 07:29:45,006 INFO L226 Difference]: Without dead ends: 320 [2020-11-28 07:29:45,007 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-11-28 07:29:45,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2020-11-28 07:29:45,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2020-11-28 07:29:45,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2020-11-28 07:29:45,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 816 transitions. [2020-11-28 07:29:45,023 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 816 transitions. Word has length 13 [2020-11-28 07:29:45,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:45,023 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 816 transitions. [2020-11-28 07:29:45,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:29:45,024 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 816 transitions. [2020-11-28 07:29:45,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-28 07:29:45,027 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:45,027 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:45,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 07:29:45,028 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:45,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:45,028 INFO L82 PathProgramCache]: Analyzing trace with hash -925135082, now seen corresponding path program 1 times [2020-11-28 07:29:45,029 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:45,029 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530116324] [2020-11-28 07:29:45,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:45,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530116324] [2020-11-28 07:29:45,249 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:45,249 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:29:45,249 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083322734] [2020-11-28 07:29:45,250 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:29:45,250 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:45,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:29:45,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:29:45,251 INFO L87 Difference]: Start difference. First operand 320 states and 816 transitions. Second operand 5 states. [2020-11-28 07:29:45,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:45,364 INFO L93 Difference]: Finished difference Result 265 states and 624 transitions. [2020-11-28 07:29:45,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:29:45,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-11-28 07:29:45,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:45,369 INFO L225 Difference]: With dead ends: 265 [2020-11-28 07:29:45,369 INFO L226 Difference]: Without dead ends: 205 [2020-11-28 07:29:45,369 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-11-28 07:29:45,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2020-11-28 07:29:45,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2020-11-28 07:29:45,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2020-11-28 07:29:45,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 471 transitions. [2020-11-28 07:29:45,378 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 471 transitions. Word has length 15 [2020-11-28 07:29:45,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:45,379 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 471 transitions. [2020-11-28 07:29:45,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:29:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 471 transitions. [2020-11-28 07:29:45,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-28 07:29:45,380 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:45,380 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:45,380 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 07:29:45,380 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:45,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:45,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1507823083, now seen corresponding path program 1 times [2020-11-28 07:29:45,381 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:45,382 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461821178] [2020-11-28 07:29:45,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:45,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:45,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:45,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461821178] [2020-11-28 07:29:45,603 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:45,603 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 07:29:45,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952897006] [2020-11-28 07:29:45,603 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 07:29:45,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:45,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 07:29:45,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:29:45,604 INFO L87 Difference]: Start difference. First operand 205 states and 471 transitions. Second operand 6 states. [2020-11-28 07:29:45,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:45,700 INFO L93 Difference]: Finished difference Result 186 states and 431 transitions. [2020-11-28 07:29:45,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 07:29:45,701 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-11-28 07:29:45,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:45,702 INFO L225 Difference]: With dead ends: 186 [2020-11-28 07:29:45,702 INFO L226 Difference]: Without dead ends: 173 [2020-11-28 07:29:45,702 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-11-28 07:29:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2020-11-28 07:29:45,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2020-11-28 07:29:45,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2020-11-28 07:29:45,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 407 transitions. [2020-11-28 07:29:45,708 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 407 transitions. Word has length 18 [2020-11-28 07:29:45,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:45,709 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 407 transitions. [2020-11-28 07:29:45,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 07:29:45,709 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 407 transitions. [2020-11-28 07:29:45,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:29:45,710 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:45,710 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:45,710 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 07:29:45,711 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:45,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:45,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1217699242, now seen corresponding path program 1 times [2020-11-28 07:29:45,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:45,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775114772] [2020-11-28 07:29:45,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:45,881 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775114772] [2020-11-28 07:29:45,881 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:45,881 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 07:29:45,881 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086619816] [2020-11-28 07:29:45,882 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 07:29:45,882 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:45,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 07:29:45,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 07:29:45,883 INFO L87 Difference]: Start difference. First operand 173 states and 407 transitions. Second operand 4 states. [2020-11-28 07:29:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:45,915 INFO L93 Difference]: Finished difference Result 220 states and 505 transitions. [2020-11-28 07:29:45,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 07:29:45,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2020-11-28 07:29:45,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:45,917 INFO L225 Difference]: With dead ends: 220 [2020-11-28 07:29:45,917 INFO L226 Difference]: Without dead ends: 92 [2020-11-28 07:29:45,918 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-11-28 07:29:45,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-11-28 07:29:45,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-11-28 07:29:45,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-11-28 07:29:45,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 185 transitions. [2020-11-28 07:29:45,922 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 185 transitions. Word has length 21 [2020-11-28 07:29:45,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:45,922 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 185 transitions. [2020-11-28 07:29:45,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 07:29:45,922 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 185 transitions. [2020-11-28 07:29:45,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:29:45,923 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:45,923 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:45,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 07:29:45,925 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:45,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:45,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1461062086, now seen corresponding path program 2 times [2020-11-28 07:29:45,926 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:45,926 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78192572] [2020-11-28 07:29:45,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:45,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:46,012 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78192572] [2020-11-28 07:29:46,012 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:46,012 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 07:29:46,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389980933] [2020-11-28 07:29:46,013 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 07:29:46,013 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:46,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 07:29:46,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:29:46,014 INFO L87 Difference]: Start difference. First operand 92 states and 185 transitions. Second operand 3 states. [2020-11-28 07:29:46,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:46,031 INFO L93 Difference]: Finished difference Result 118 states and 233 transitions. [2020-11-28 07:29:46,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 07:29:46,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-11-28 07:29:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:46,033 INFO L225 Difference]: With dead ends: 118 [2020-11-28 07:29:46,033 INFO L226 Difference]: Without dead ends: 48 [2020-11-28 07:29:46,034 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 07:29:46,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-11-28 07:29:46,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-11-28 07:29:46,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-11-28 07:29:46,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 81 transitions. [2020-11-28 07:29:46,036 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 81 transitions. Word has length 21 [2020-11-28 07:29:46,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:46,036 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 81 transitions. [2020-11-28 07:29:46,037 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 07:29:46,037 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 81 transitions. [2020-11-28 07:29:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:29:46,037 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:46,037 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:46,038 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 07:29:46,038 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash -267942436, now seen corresponding path program 3 times [2020-11-28 07:29:46,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:46,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653559929] [2020-11-28 07:29:46,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:46,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 07:29:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 07:29:46,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653559929] [2020-11-28 07:29:46,200 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 07:29:46,200 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 07:29:46,200 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324836500] [2020-11-28 07:29:46,200 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 07:29:46,201 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2020-11-28 07:29:46,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 07:29:46,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 07:29:46,201 INFO L87 Difference]: Start difference. First operand 48 states and 81 transitions. Second operand 5 states. [2020-11-28 07:29:46,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 07:29:46,296 INFO L93 Difference]: Finished difference Result 58 states and 95 transitions. [2020-11-28 07:29:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 07:29:46,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-11-28 07:29:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 07:29:46,298 INFO L225 Difference]: With dead ends: 58 [2020-11-28 07:29:46,298 INFO L226 Difference]: Without dead ends: 32 [2020-11-28 07:29:46,299 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-28 07:29:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2020-11-28 07:29:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2020-11-28 07:29:46,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-28 07:29:46,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2020-11-28 07:29:46,301 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 21 [2020-11-28 07:29:46,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 07:29:46,301 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2020-11-28 07:29:46,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 07:29:46,301 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2020-11-28 07:29:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-28 07:29:46,302 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 07:29:46,302 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 07:29:46,302 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 07:29:46,302 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 07:29:46,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 07:29:46,303 INFO L82 PathProgramCache]: Analyzing trace with hash 167132730, now seen corresponding path program 4 times [2020-11-28 07:29:46,303 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2020-11-28 07:29:46,303 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475064538] [2020-11-28 07:29:46,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 07:29:46,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:29:46,368 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:29:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 07:29:46,422 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 07:29:46,485 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2020-11-28 07:29:46,485 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 07:29:46,485 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 07:29:46,486 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-11-28 07:29:46,509 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L852-->L859: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In1833196370 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In1833196370 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1833196370 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In1833196370 256) 0))) (let ((.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In1833196370 ~z$r_buff0_thd0~0_Out1833196370) (or (and (= ~z~0_Out1833196370 ~z$w_buff0~0_In1833196370) .cse0 .cse1) (and .cse2 (or (and (= ~z$w_buff1~0_In1833196370 ~z~0_Out1833196370) .cse3 .cse4) (and (= ~z~0_In1833196370 ~z~0_Out1833196370) .cse5)))) (= ~z$r_buff1_thd0~0_Out1833196370 ~z$r_buff1_thd0~0_In1833196370) (or (and (= ~z$w_buff1_used~0_Out1833196370 ~z$w_buff1_used~0_In1833196370) .cse5) (and (= ~z$w_buff1_used~0_Out1833196370 0) .cse3 .cse4)) (or (and (= ~z$w_buff0_used~0_In1833196370 ~z$w_buff0_used~0_Out1833196370) .cse2) (and (= ~z$w_buff0_used~0_Out1833196370 0) .cse0 .cse1)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1833196370 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1833196370|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1833196370 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1833196370|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1833196370, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1833196370, ~z$w_buff0~0=~z$w_buff0~0_In1833196370, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1833196370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1833196370, ~z$w_buff1~0=~z$w_buff1~0_In1833196370, ~z~0=~z~0_In1833196370} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1833196370, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1833196370|, ~z$w_buff0~0=~z$w_buff0~0_In1833196370, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1833196370, ~z$w_buff1~0=~z$w_buff1~0_In1833196370, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1833196370|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1833196370|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1833196370|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1833196370|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1833196370, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1833196370|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1833196370|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1833196370, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1833196370, ~z~0=~z~0_Out1833196370} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2020-11-28 07:29:46,519 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,520 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 07:29:46,522 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,523 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,523 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,523 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,524 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,524 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,524 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,525 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,525 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,526 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,526 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,527 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,527 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,528 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,528 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,529 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,529 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,530 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,535 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,536 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 07:29:46 BasicIcfg [2020-11-28 07:29:46,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 07:29:46,658 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 07:29:46,658 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 07:29:46,659 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 07:29:46,659 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 07:29:35" (3/4) ... [2020-11-28 07:29:46,661 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 07:29:46,679 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [896] [896] L852-->L859: Formula: (let ((.cse6 (= (mod ~z$r_buff0_thd0~0_In1833196370 256) 0)) (.cse7 (= (mod ~z$w_buff0_used~0_In1833196370 256) 0)) (.cse8 (= (mod ~z$r_buff1_thd0~0_In1833196370 256) 0)) (.cse9 (= (mod ~z$w_buff1_used~0_In1833196370 256) 0))) (let ((.cse5 (or .cse8 .cse9)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse2 (or .cse6 .cse7)) (.cse0 (not .cse7)) (.cse1 (not .cse6))) (and (= ~z$r_buff0_thd0~0_In1833196370 ~z$r_buff0_thd0~0_Out1833196370) (or (and (= ~z~0_Out1833196370 ~z$w_buff0~0_In1833196370) .cse0 .cse1) (and .cse2 (or (and (= ~z$w_buff1~0_In1833196370 ~z~0_Out1833196370) .cse3 .cse4) (and (= ~z~0_In1833196370 ~z~0_Out1833196370) .cse5)))) (= ~z$r_buff1_thd0~0_Out1833196370 ~z$r_buff1_thd0~0_In1833196370) (or (and (= ~z$w_buff1_used~0_Out1833196370 ~z$w_buff1_used~0_In1833196370) .cse5) (and (= ~z$w_buff1_used~0_Out1833196370 0) .cse3 .cse4)) (or (and (= ~z$w_buff0_used~0_In1833196370 ~z$w_buff0_used~0_Out1833196370) .cse2) (and (= ~z$w_buff0_used~0_Out1833196370 0) .cse0 .cse1)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out1833196370 |ULTIMATE.start_assume_abort_if_not_#in~cond_In1833196370|) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out1833196370 0))))) InVars {ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1833196370|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1833196370, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1833196370, ~z$w_buff0~0=~z$w_buff0~0_In1833196370, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1833196370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1833196370, ~z$w_buff1~0=~z$w_buff1~0_In1833196370, ~z~0=~z~0_In1833196370} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_Out1833196370, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1833196370|, ~z$w_buff0~0=~z$w_buff0~0_In1833196370, ~z$w_buff1_used~0=~z$w_buff1_used~0_Out1833196370, ~z$w_buff1~0=~z$w_buff1~0_In1833196370, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out1833196370|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1833196370|, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1833196370|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In1833196370|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_Out1833196370, ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1833196370|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1833196370|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out1833196370, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out1833196370, ~z~0=~z~0_Out1833196370} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_assume_abort_if_not_~cond, ~z$w_buff0_used~0, ULTIMATE.start_main_#t~ite39, ~z$r_buff1_thd0~0, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~z~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2020-11-28 07:29:46,681 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,682 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [799] [2020-11-28 07:29:46,682 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,683 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,683 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,684 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,684 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,685 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,685 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,686 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,686 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,687 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,687 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,688 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-11-28 07:29:46,688 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-28 07:29:46,811 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ab60fb48-22ca-4bef-b4fc-b8704290e10a/bin/utaipan/witness.graphml [2020-11-28 07:29:46,811 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 07:29:46,813 INFO L168 Benchmark]: Toolchain (without parser) took 15168.61 ms. Allocated memory was 92.3 MB in the beginning and 232.8 MB in the end (delta: 140.5 MB). Free memory was 61.3 MB in the beginning and 110.0 MB in the end (delta: -48.6 MB). Peak memory consumption was 91.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:29:46,813 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 92.3 MB. Free memory is still 48.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 07:29:46,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.25 ms. Allocated memory was 92.3 MB in the beginning and 121.6 MB in the end (delta: 29.4 MB). Free memory was 61.1 MB in the beginning and 97.2 MB in the end (delta: -36.1 MB). Peak memory consumption was 17.0 MB. Max. memory is 16.1 GB. [2020-11-28 07:29:46,814 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.93 ms. Allocated memory is still 121.6 MB. Free memory was 97.2 MB in the beginning and 94.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:29:46,815 INFO L168 Benchmark]: Boogie Preprocessor took 78.43 ms. Allocated memory is still 121.6 MB. Free memory was 94.9 MB in the beginning and 92.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 07:29:46,815 INFO L168 Benchmark]: RCFGBuilder took 3103.38 ms. Allocated memory is still 121.6 MB. Free memory was 92.8 MB in the beginning and 86.9 MB in the end (delta: 5.9 MB). Peak memory consumption was 67.6 MB. Max. memory is 16.1 GB. [2020-11-28 07:29:46,816 INFO L168 Benchmark]: TraceAbstraction took 10863.49 ms. Allocated memory was 121.6 MB in the beginning and 232.8 MB in the end (delta: 111.1 MB). Free memory was 86.9 MB in the beginning and 126.7 MB in the end (delta: -39.8 MB). Peak memory consumption was 71.5 MB. Max. memory is 16.1 GB. [2020-11-28 07:29:46,816 INFO L168 Benchmark]: Witness Printer took 153.36 ms. Allocated memory is still 232.8 MB. Free memory was 126.7 MB in the beginning and 110.0 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2020-11-28 07:29:46,819 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.30 ms. Allocated memory is still 92.3 MB. Free memory is still 48.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 843.25 ms. Allocated memory was 92.3 MB in the beginning and 121.6 MB in the end (delta: 29.4 MB). Free memory was 61.1 MB in the beginning and 97.2 MB in the end (delta: -36.1 MB). Peak memory consumption was 17.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 117.93 ms. Allocated memory is still 121.6 MB. Free memory was 97.2 MB in the beginning and 94.9 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.43 ms. Allocated memory is still 121.6 MB. Free memory was 94.9 MB in the beginning and 92.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3103.38 ms. Allocated memory is still 121.6 MB. Free memory was 92.8 MB in the beginning and 86.9 MB in the end (delta: 5.9 MB). Peak memory consumption was 67.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10863.49 ms. Allocated memory was 121.6 MB in the beginning and 232.8 MB in the end (delta: 111.1 MB). Free memory was 86.9 MB in the beginning and 126.7 MB in the end (delta: -39.8 MB). Peak memory consumption was 71.5 MB. Max. memory is 16.1 GB. * Witness Printer took 153.36 ms. Allocated memory is still 232.8 MB. Free memory was 126.7 MB in the beginning and 110.0 MB in the end (delta: 16.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 1443 VarBasedMoverChecksPositive, 71 VarBasedMoverChecksNegative, 8 SemBasedMoverChecksPositive, 63 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 146 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 7.4s, 115 PlacesBefore, 36 PlacesAfterwards, 108 TransitionsBefore, 26 TransitionsAfterwards, 2024 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 3 ChoiceCompositions, 98 TotalNumberOfCompositions, 4880 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_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; [L719] 0 int a = 0; [L721] 0 int b = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L843] 0 pthread_t t882; [L844] FCALL, FORK 0 pthread_create(&t882, ((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, a=0, arg={0:0}, b=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 t883; [L846] FCALL, FORK 0 pthread_create(&t883, ((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, a=0, arg={0:0}, arg={0:0}, b=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 t884; [L848] FCALL, FORK 0 pthread_create(&t884, ((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, a=0, arg={0:0}, arg={0:0}, b=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] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=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=1, 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] [L812] 3 a = 1 [L815] 3 __unbuffered_p2_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=1, 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] [L818] 3 __unbuffered_p2_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, b=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=1, 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] [L751] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=1, 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] [L754] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L766] 2 x = 2 [L769] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1 [L779] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1 [L781] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1) [L781] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L785] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] EXPR 2 z$flush_delayed ? z$mem_tmp : z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=51, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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] [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; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L850] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L861] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix033_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, 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=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, 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, 106 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 10.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 231 SDtfs, 170 SDslu, 319 SDs, 0 SdLazy, 117 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=750occurred 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.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 157 NumberOfCodeBlocks, 157 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 127 ConstructedInterpolants, 0 QuantifiedInterpolants, 6453 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...