./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc.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_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6a710900f1f029bcc9e495df7844bc4699529215 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-29 23:55:34,969 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 23:55:34,972 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 23:55:35,038 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 23:55:35,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 23:55:35,045 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 23:55:35,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 23:55:35,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 23:55:35,061 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 23:55:35,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 23:55:35,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 23:55:35,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 23:55:35,070 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 23:55:35,073 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 23:55:35,075 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 23:55:35,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 23:55:35,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 23:55:35,082 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 23:55:35,085 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 23:55:35,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 23:55:35,094 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 23:55:35,096 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 23:55:35,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 23:55:35,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 23:55:35,102 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 23:55:35,103 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 23:55:35,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 23:55:35,105 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 23:55:35,106 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 23:55:35,107 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 23:55:35,107 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 23:55:35,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 23:55:35,110 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 23:55:35,112 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 23:55:35,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 23:55:35,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 23:55:35,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 23:55:35,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 23:55:35,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 23:55:35,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 23:55:35,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 23:55:35,120 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 23:55:35,157 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 23:55:35,157 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 23:55:35,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 23:55:35,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 23:55:35,159 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 23:55:35,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 23:55:35,160 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 23:55:35,160 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 23:55:35,160 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 23:55:35,160 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 23:55:35,162 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 23:55:35,162 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 23:55:35,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 23:55:35,162 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 23:55:35,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 23:55:35,163 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 23:55:35,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 23:55:35,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 23:55:35,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 23:55:35,164 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 23:55:35,164 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 23:55:35,164 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:55:35,164 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 23:55:35,164 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 23:55:35,165 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 23:55:35,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 23:55:35,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 23:55:35,165 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 23:55:35,166 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 23:55:35,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6a710900f1f029bcc9e495df7844bc4699529215 [2020-11-29 23:55:35,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 23:55:35,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 23:55:35,469 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 23:55:35,471 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 23:55:35,471 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 23:55:35,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc.i [2020-11-29 23:55:35,540 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/data/7c968566b/8133e64a61354c5a84bf85f0dbd3020d/FLAG6ae227208 [2020-11-29 23:55:36,230 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 23:55:36,233 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/sv-benchmarks/c/pthread-wmm/mix037_power.oepc.i [2020-11-29 23:55:36,256 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/data/7c968566b/8133e64a61354c5a84bf85f0dbd3020d/FLAG6ae227208 [2020-11-29 23:55:36,466 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/data/7c968566b/8133e64a61354c5a84bf85f0dbd3020d [2020-11-29 23:55:36,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 23:55:36,472 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 23:55:36,479 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 23:55:36,479 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 23:55:36,483 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 23:55:36,484 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:55:36" (1/1) ... [2020-11-29 23:55:36,487 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@489b51af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:36, skipping insertion in model container [2020-11-29 23:55:36,487 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 11:55:36" (1/1) ... [2020-11-29 23:55:36,494 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 23:55:36,570 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 23:55:37,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:55:37,117 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 23:55:37,197 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 23:55:37,283 INFO L208 MainTranslator]: Completed translation [2020-11-29 23:55:37,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37 WrapperNode [2020-11-29 23:55:37,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 23:55:37,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 23:55:37,285 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 23:55:37,285 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 23:55:37,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,339 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,376 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 23:55:37,377 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 23:55:37,377 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 23:55:37,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 23:55:37,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,403 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,407 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... [2020-11-29 23:55:37,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 23:55:37,418 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 23:55:37,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 23:55:37,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 23:55:37,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 23:55:37,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-29 23:55:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-29 23:55:37,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 23:55:37,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-29 23:55:37,508 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-29 23:55:37,508 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-29 23:55:37,509 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-29 23:55:37,509 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-29 23:55:37,509 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-29 23:55:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-29 23:55:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-11-29 23:55:37,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-11-29 23:55:37,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 23:55:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-29 23:55:37,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 23:55:37,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 23:55:37,513 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-29 23:55:40,556 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 23:55:40,556 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-29 23:55:40,558 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:55:40 BoogieIcfgContainer [2020-11-29 23:55:40,558 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 23:55:40,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 23:55:40,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 23:55:40,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 23:55:40,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 11:55:36" (1/3) ... [2020-11-29 23:55:40,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c702e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:55:40, skipping insertion in model container [2020-11-29 23:55:40,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 11:55:37" (2/3) ... [2020-11-29 23:55:40,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c702e13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 11:55:40, skipping insertion in model container [2020-11-29 23:55:40,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:55:40" (3/3) ... [2020-11-29 23:55:40,566 INFO L111 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc.i [2020-11-29 23:55:40,577 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-29 23:55:40,577 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 23:55:40,581 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 23:55:40,582 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-29 23:55:40,629 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,630 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,630 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,630 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,631 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,631 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,631 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,632 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,633 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,634 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,634 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,634 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,634 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,635 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,636 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,637 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,637 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,637 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,638 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,639 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,639 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,639 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,640 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,640 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,641 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,642 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,643 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,644 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,645 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,647 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,648 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,649 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,651 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,651 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,652 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,654 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,655 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,655 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,656 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,658 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,658 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,658 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,659 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,660 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,661 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,662 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,663 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,665 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,665 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,666 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,666 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,666 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,667 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-29 23:55:40,668 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-29 23:55:40,679 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-11-29 23:55:40,704 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 23:55:40,705 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 23:55:40,705 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 23:55:40,705 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 23:55:40,705 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 23:55:40,705 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 23:55:40,705 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 23:55:40,705 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 23:55:40,722 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-11-29 23:55:40,724 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 124 transitions, 268 flow [2020-11-29 23:55:40,727 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 134 places, 124 transitions, 268 flow [2020-11-29 23:55:40,729 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 134 places, 124 transitions, 268 flow [2020-11-29 23:55:40,800 INFO L129 PetriNetUnfolder]: 3/120 cut-off events. [2020-11-29 23:55:40,800 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-11-29 23:55:40,805 INFO L80 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 120 events. 3/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 102 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-11-29 23:55:40,812 INFO L116 LiptonReduction]: Number of co-enabled transitions 3124 [2020-11-29 23:55:40,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:40,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:40,958 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:40,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:40,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:40,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:40,977 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:40,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,013 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,014 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,075 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,076 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,077 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,082 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,112 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,117 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,206 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,208 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,243 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,245 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,246 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,248 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:41,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,251 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:41,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:41,484 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:55:41,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:41,916 WARN L193 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-11-29 23:55:42,079 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,086 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,111 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,113 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,114 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,240 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,240 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,241 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,242 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,244 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,246 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,264 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,265 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,268 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,268 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,271 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,271 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,640 WARN L193 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-11-29 23:55:42,827 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,829 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,833 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,851 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,851 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,852 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,852 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,854 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,855 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,857 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,857 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,910 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,911 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,913 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:42,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:42,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:42,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:42,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:43,086 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:55:43,087 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,157 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:43,158 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:43,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,160 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:43,161 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:43,163 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:43,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:43,175 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:43,176 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:43,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,178 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:43,178 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:43,180 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:43,180 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:43,362 WARN L193 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-11-29 23:55:43,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:55:43,454 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 23:55:43,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:43,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 23:55:43,532 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:43,533 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 23:55:43,534 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:43,589 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:55:43,589 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:55:43,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:43,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 23:55:43,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:43,956 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 23:55:43,956 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:43,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 23:55:43,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:44,029 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:55:44,029 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,103 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,104 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,106 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:44,108 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,108 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:44,132 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,132 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,135 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,135 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:44,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,138 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:44,337 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,337 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,338 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,338 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,340 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,340 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:44,342 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:44,354 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,354 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,355 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,357 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,357 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:44,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:44,595 WARN L193 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-11-29 23:55:44,967 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-11-29 23:55:44,967 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,986 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,987 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,987 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:44,989 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:44,989 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:44,990 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:44,991 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,006 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,006 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,007 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,007 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,008 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,009 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:45,010 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,010 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:45,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,061 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,061 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,062 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:45,064 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,064 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:45,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,081 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,083 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,083 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,085 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,085 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,356 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 23:55:45,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 23:55:45,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,420 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:55:45,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,423 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:55:45,424 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:55:45,426 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 23:55:45,426 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,428 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-29 23:55:45,428 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,429 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-29 23:55:45,430 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,476 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,492 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,493 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:55:45,495 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,495 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:55:45,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,496 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-11-29 23:55:45,499 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-11-29 23:55:45,499 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,500 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-29 23:55:45,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,503 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-29 23:55:45,503 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,543 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-11-29 23:55:45,543 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-11-29 23:55:45,545 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-11-29 23:55:45,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,580 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,580 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,581 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,581 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,583 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,583 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,584 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,584 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-29 23:55:45,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,597 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,597 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,598 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-29 23:55:45,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-11-29 23:55:45,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:45,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-11-29 23:55:45,601 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-11-29 23:55:46,132 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-11-29 23:55:46,595 WARN L193 SmtUtils]: Spent 457.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 126 [2020-11-29 23:55:46,789 WARN L193 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2020-11-29 23:55:46,799 INFO L131 LiptonReduction]: Checked pairs total: 9364 [2020-11-29 23:55:46,800 INFO L133 LiptonReduction]: Total number of compositions: 106 [2020-11-29 23:55:46,805 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-11-29 23:55:47,217 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5774 states. [2020-11-29 23:55:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand 5774 states. [2020-11-29 23:55:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-11-29 23:55:47,225 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:47,225 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-11-29 23:55:47,226 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:47,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:47,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1255754, now seen corresponding path program 1 times [2020-11-29 23:55:47,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:47,243 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786618004] [2020-11-29 23:55:47,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:47,520 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-29 23:55:47,520 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786618004] [2020-11-29 23:55:47,521 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:47,521 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-11-29 23:55:47,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218409854] [2020-11-29 23:55:47,525 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 23:55:47,526 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:47,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 23:55:47,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 23:55:47,543 INFO L87 Difference]: Start difference. First operand 5774 states. Second operand 3 states. [2020-11-29 23:55:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:47,746 INFO L93 Difference]: Finished difference Result 4812 states and 19300 transitions. [2020-11-29 23:55:47,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 23:55:47,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-11-29 23:55:47,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:47,823 INFO L225 Difference]: With dead ends: 4812 [2020-11-29 23:55:47,823 INFO L226 Difference]: Without dead ends: 4062 [2020-11-29 23:55:47,824 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-29 23:55:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2020-11-29 23:55:48,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2020-11-29 23:55:48,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4062 states. [2020-11-29 23:55:48,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2020-11-29 23:55:48,169 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 3 [2020-11-29 23:55:48,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:48,169 INFO L481 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2020-11-29 23:55:48,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 23:55:48,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2020-11-29 23:55:48,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-11-29 23:55:48,181 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:48,181 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:48,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 23:55:48,187 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:48,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:48,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1477598623, now seen corresponding path program 1 times [2020-11-29 23:55:48,190 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:48,191 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799013276] [2020-11-29 23:55:48,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:48,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:48,465 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-29 23:55:48,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799013276] [2020-11-29 23:55:48,466 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:48,466 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 23:55:48,466 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938211549] [2020-11-29 23:55:48,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:55:48,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:48,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:55:48,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:55:48,469 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand 4 states. [2020-11-29 23:55:48,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:48,602 INFO L93 Difference]: Finished difference Result 4692 states and 18054 transitions. [2020-11-29 23:55:48,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:55:48,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-11-29 23:55:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:48,652 INFO L225 Difference]: With dead ends: 4692 [2020-11-29 23:55:48,652 INFO L226 Difference]: Without dead ends: 3942 [2020-11-29 23:55:48,653 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:55:48,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3942 states. [2020-11-29 23:55:48,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3942 to 3942. [2020-11-29 23:55:48,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3942 states. [2020-11-29 23:55:48,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3942 states to 3942 states and 15569 transitions. [2020-11-29 23:55:48,870 INFO L78 Accepts]: Start accepts. Automaton has 3942 states and 15569 transitions. Word has length 12 [2020-11-29 23:55:48,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:48,871 INFO L481 AbstractCegarLoop]: Abstraction has 3942 states and 15569 transitions. [2020-11-29 23:55:48,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:55:48,871 INFO L276 IsEmpty]: Start isEmpty. Operand 3942 states and 15569 transitions. [2020-11-29 23:55:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-11-29 23:55:48,874 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:48,874 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:48,874 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 23:55:48,874 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:48,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:48,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1808145988, now seen corresponding path program 1 times [2020-11-29 23:55:48,885 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:48,885 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772031362] [2020-11-29 23:55:48,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:48,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:49,026 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-29 23:55:49,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772031362] [2020-11-29 23:55:49,026 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:49,026 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 23:55:49,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803227754] [2020-11-29 23:55:49,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:55:49,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:49,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:55:49,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:55:49,028 INFO L87 Difference]: Start difference. First operand 3942 states and 15569 transitions. Second operand 4 states. [2020-11-29 23:55:49,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:49,094 INFO L93 Difference]: Finished difference Result 4172 states and 15998 transitions. [2020-11-29 23:55:49,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:55:49,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-11-29 23:55:49,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:49,130 INFO L225 Difference]: With dead ends: 4172 [2020-11-29 23:55:49,130 INFO L226 Difference]: Without dead ends: 3482 [2020-11-29 23:55:49,130 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:55:49,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3482 states. [2020-11-29 23:55:49,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3482 to 3482. [2020-11-29 23:55:49,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3482 states. [2020-11-29 23:55:49,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3482 states to 3482 states and 13561 transitions. [2020-11-29 23:55:49,336 INFO L78 Accepts]: Start accepts. Automaton has 3482 states and 13561 transitions. Word has length 13 [2020-11-29 23:55:49,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:49,336 INFO L481 AbstractCegarLoop]: Abstraction has 3482 states and 13561 transitions. [2020-11-29 23:55:49,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:55:49,337 INFO L276 IsEmpty]: Start isEmpty. Operand 3482 states and 13561 transitions. [2020-11-29 23:55:49,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-11-29 23:55:49,341 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:49,341 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:49,341 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 23:55:49,341 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:49,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:49,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1830209999, now seen corresponding path program 1 times [2020-11-29 23:55:49,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:49,343 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692308502] [2020-11-29 23:55:49,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:49,433 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-29 23:55:49,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692308502] [2020-11-29 23:55:49,433 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:49,433 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:55:49,433 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85764999] [2020-11-29 23:55:49,434 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:55:49,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:49,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:55:49,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:55:49,435 INFO L87 Difference]: Start difference. First operand 3482 states and 13561 transitions. Second operand 4 states. [2020-11-29 23:55:49,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:49,512 INFO L93 Difference]: Finished difference Result 3256 states and 11426 transitions. [2020-11-29 23:55:49,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 23:55:49,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-11-29 23:55:49,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:49,535 INFO L225 Difference]: With dead ends: 3256 [2020-11-29 23:55:49,535 INFO L226 Difference]: Without dead ends: 2506 [2020-11-29 23:55:49,535 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-29 23:55:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2020-11-29 23:55:49,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2506. [2020-11-29 23:55:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2506 states. [2020-11-29 23:55:49,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2506 states to 2506 states and 8681 transitions. [2020-11-29 23:55:49,637 INFO L78 Accepts]: Start accepts. Automaton has 2506 states and 8681 transitions. Word has length 15 [2020-11-29 23:55:49,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:49,637 INFO L481 AbstractCegarLoop]: Abstraction has 2506 states and 8681 transitions. [2020-11-29 23:55:49,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:55:49,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2506 states and 8681 transitions. [2020-11-29 23:55:49,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 23:55:49,641 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:49,641 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-29 23:55:49,641 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 23:55:49,641 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:49,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:49,642 INFO L82 PathProgramCache]: Analyzing trace with hash 2117656885, now seen corresponding path program 1 times [2020-11-29 23:55:49,642 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:49,642 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457775050] [2020-11-29 23:55:49,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:49,841 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-29 23:55:49,842 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457775050] [2020-11-29 23:55:49,842 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:49,842 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 23:55:49,842 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872275593] [2020-11-29 23:55:49,842 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 23:55:49,843 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:49,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 23:55:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 23:55:49,843 INFO L87 Difference]: Start difference. First operand 2506 states and 8681 transitions. Second operand 4 states. [2020-11-29 23:55:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:49,911 INFO L93 Difference]: Finished difference Result 4030 states and 13514 transitions. [2020-11-29 23:55:49,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:55:49,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2020-11-29 23:55:49,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:49,941 INFO L225 Difference]: With dead ends: 4030 [2020-11-29 23:55:49,941 INFO L226 Difference]: Without dead ends: 2698 [2020-11-29 23:55:49,941 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-29 23:55:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2020-11-29 23:55:50,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2434. [2020-11-29 23:55:50,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2434 states. [2020-11-29 23:55:50,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2434 states to 2434 states and 8127 transitions. [2020-11-29 23:55:50,033 INFO L78 Accepts]: Start accepts. Automaton has 2434 states and 8127 transitions. Word has length 18 [2020-11-29 23:55:50,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:50,034 INFO L481 AbstractCegarLoop]: Abstraction has 2434 states and 8127 transitions. [2020-11-29 23:55:50,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 23:55:50,034 INFO L276 IsEmpty]: Start isEmpty. Operand 2434 states and 8127 transitions. [2020-11-29 23:55:50,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-11-29 23:55:50,038 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:50,038 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-29 23:55:50,039 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 23:55:50,039 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:50,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:50,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1638518981, now seen corresponding path program 1 times [2020-11-29 23:55:50,040 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:50,040 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945828005] [2020-11-29 23:55:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:50,156 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-29 23:55:50,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945828005] [2020-11-29 23:55:50,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:50,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 23:55:50,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637577925] [2020-11-29 23:55:50,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 23:55:50,157 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:50,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 23:55:50,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-29 23:55:50,158 INFO L87 Difference]: Start difference. First operand 2434 states and 8127 transitions. Second operand 5 states. [2020-11-29 23:55:50,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:50,223 INFO L93 Difference]: Finished difference Result 1920 states and 5834 transitions. [2020-11-29 23:55:50,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 23:55:50,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-11-29 23:55:50,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:50,229 INFO L225 Difference]: With dead ends: 1920 [2020-11-29 23:55:50,230 INFO L226 Difference]: Without dead ends: 1490 [2020-11-29 23:55:50,230 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:55:50,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-11-29 23:55:50,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 1490. [2020-11-29 23:55:50,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1490 states. [2020-11-29 23:55:50,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1490 states to 1490 states and 4445 transitions. [2020-11-29 23:55:50,277 INFO L78 Accepts]: Start accepts. Automaton has 1490 states and 4445 transitions. Word has length 18 [2020-11-29 23:55:50,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:50,278 INFO L481 AbstractCegarLoop]: Abstraction has 1490 states and 4445 transitions. [2020-11-29 23:55:50,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 23:55:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1490 states and 4445 transitions. [2020-11-29 23:55:50,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-11-29 23:55:50,282 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:50,282 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-29 23:55:50,282 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 23:55:50,282 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:50,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:50,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1994364792, now seen corresponding path program 1 times [2020-11-29 23:55:50,283 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:50,283 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418615920] [2020-11-29 23:55:50,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 23:55:50,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418615920] [2020-11-29 23:55:50,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:50,448 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 23:55:50,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228013354] [2020-11-29 23:55:50,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-29 23:55:50,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:50,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-29 23:55:50,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-29 23:55:50,449 INFO L87 Difference]: Start difference. First operand 1490 states and 4445 transitions. Second operand 6 states. [2020-11-29 23:55:50,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:50,537 INFO L93 Difference]: Finished difference Result 1254 states and 3711 transitions. [2020-11-29 23:55:50,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 23:55:50,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2020-11-29 23:55:50,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:50,542 INFO L225 Difference]: With dead ends: 1254 [2020-11-29 23:55:50,542 INFO L226 Difference]: Without dead ends: 1128 [2020-11-29 23:55:50,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:55:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1128 states. [2020-11-29 23:55:50,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1128 to 1128. [2020-11-29 23:55:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2020-11-29 23:55:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 3383 transitions. [2020-11-29 23:55:50,579 INFO L78 Accepts]: Start accepts. Automaton has 1128 states and 3383 transitions. Word has length 21 [2020-11-29 23:55:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:50,580 INFO L481 AbstractCegarLoop]: Abstraction has 1128 states and 3383 transitions. [2020-11-29 23:55:50,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-29 23:55:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1128 states and 3383 transitions. [2020-11-29 23:55:50,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 23:55:50,583 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:50,583 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:50,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 23:55:50,584 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:50,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:50,584 INFO L82 PathProgramCache]: Analyzing trace with hash 222902783, now seen corresponding path program 1 times [2020-11-29 23:55:50,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:50,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73759311] [2020-11-29 23:55:50,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:50,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:51,051 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-29 23:55:51,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73759311] [2020-11-29 23:55:51,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:51,052 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 23:55:51,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21203528] [2020-11-29 23:55:51,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:55:51,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:51,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:55:51,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:55:51,054 INFO L87 Difference]: Start difference. First operand 1128 states and 3383 transitions. Second operand 12 states. [2020-11-29 23:55:52,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:52,083 INFO L93 Difference]: Finished difference Result 1683 states and 4880 transitions. [2020-11-29 23:55:52,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-11-29 23:55:52,084 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-11-29 23:55:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:52,089 INFO L225 Difference]: With dead ends: 1683 [2020-11-29 23:55:52,089 INFO L226 Difference]: Without dead ends: 1403 [2020-11-29 23:55:52,090 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2020-11-29 23:55:52,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-11-29 23:55:52,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 1282. [2020-11-29 23:55:52,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2020-11-29 23:55:52,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 3790 transitions. [2020-11-29 23:55:52,142 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 3790 transitions. Word has length 25 [2020-11-29 23:55:52,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:52,142 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 3790 transitions. [2020-11-29 23:55:52,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:55:52,142 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 3790 transitions. [2020-11-29 23:55:52,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 23:55:52,147 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:52,147 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:52,148 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 23:55:52,148 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:52,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:52,148 INFO L82 PathProgramCache]: Analyzing trace with hash 169503935, now seen corresponding path program 2 times [2020-11-29 23:55:52,149 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:52,149 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864780331] [2020-11-29 23:55:52,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:52,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:52,497 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-29 23:55:52,498 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864780331] [2020-11-29 23:55:52,498 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:52,498 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-29 23:55:52,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660361056] [2020-11-29 23:55:52,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-29 23:55:52,499 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:52,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-29 23:55:52,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2020-11-29 23:55:52,499 INFO L87 Difference]: Start difference. First operand 1282 states and 3790 transitions. Second operand 12 states. [2020-11-29 23:55:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:53,193 INFO L93 Difference]: Finished difference Result 1936 states and 5493 transitions. [2020-11-29 23:55:53,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-29 23:55:53,194 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2020-11-29 23:55:53,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:53,199 INFO L225 Difference]: With dead ends: 1936 [2020-11-29 23:55:53,200 INFO L226 Difference]: Without dead ends: 1788 [2020-11-29 23:55:53,202 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-11-29 23:55:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1788 states. [2020-11-29 23:55:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1788 to 1293. [2020-11-29 23:55:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1293 states. [2020-11-29 23:55:53,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 3841 transitions. [2020-11-29 23:55:53,263 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 3841 transitions. Word has length 25 [2020-11-29 23:55:53,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:53,264 INFO L481 AbstractCegarLoop]: Abstraction has 1293 states and 3841 transitions. [2020-11-29 23:55:53,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-29 23:55:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 3841 transitions. [2020-11-29 23:55:53,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-29 23:55:53,272 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:53,273 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:53,273 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 23:55:53,273 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:53,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:53,274 INFO L82 PathProgramCache]: Analyzing trace with hash -412728365, now seen corresponding path program 3 times [2020-11-29 23:55:53,274 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:53,274 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759777542] [2020-11-29 23:55:53,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:53,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:53,397 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-29 23:55:53,397 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759777542] [2020-11-29 23:55:53,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:53,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-29 23:55:53,398 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903046226] [2020-11-29 23:55:53,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-29 23:55:53,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:53,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-29 23:55:53,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 23:55:53,399 INFO L87 Difference]: Start difference. First operand 1293 states and 3841 transitions. Second operand 7 states. [2020-11-29 23:55:53,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:53,534 INFO L93 Difference]: Finished difference Result 1249 states and 3752 transitions. [2020-11-29 23:55:53,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-29 23:55:53,535 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-11-29 23:55:53,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:53,538 INFO L225 Difference]: With dead ends: 1249 [2020-11-29 23:55:53,538 INFO L226 Difference]: Without dead ends: 895 [2020-11-29 23:55:53,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-11-29 23:55:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2020-11-29 23:55:53,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 895. [2020-11-29 23:55:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2020-11-29 23:55:53,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2653 transitions. [2020-11-29 23:55:53,565 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2653 transitions. Word has length 25 [2020-11-29 23:55:53,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:53,565 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 2653 transitions. [2020-11-29 23:55:53,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-11-29 23:55:53,566 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2653 transitions. [2020-11-29 23:55:53,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-29 23:55:53,571 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:53,571 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:53,571 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 23:55:53,571 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:53,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:53,572 INFO L82 PathProgramCache]: Analyzing trace with hash 649486654, now seen corresponding path program 1 times [2020-11-29 23:55:53,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:53,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565863218] [2020-11-29 23:55:53,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:53,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 23:55:53,888 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-29 23:55:53,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565863218] [2020-11-29 23:55:53,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 23:55:53,889 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-29 23:55:53,889 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784677147] [2020-11-29 23:55:53,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-29 23:55:53,890 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 23:55:53,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-29 23:55:53,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-29 23:55:53,891 INFO L87 Difference]: Start difference. First operand 895 states and 2653 transitions. Second operand 9 states. [2020-11-29 23:55:54,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 23:55:54,280 INFO L93 Difference]: Finished difference Result 1199 states and 3503 transitions. [2020-11-29 23:55:54,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-11-29 23:55:54,281 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 29 [2020-11-29 23:55:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 23:55:54,283 INFO L225 Difference]: With dead ends: 1199 [2020-11-29 23:55:54,284 INFO L226 Difference]: Without dead ends: 752 [2020-11-29 23:55:54,284 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2020-11-29 23:55:54,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2020-11-29 23:55:54,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 456. [2020-11-29 23:55:54,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2020-11-29 23:55:54,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1241 transitions. [2020-11-29 23:55:54,301 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1241 transitions. Word has length 29 [2020-11-29 23:55:54,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 23:55:54,301 INFO L481 AbstractCegarLoop]: Abstraction has 456 states and 1241 transitions. [2020-11-29 23:55:54,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-29 23:55:54,301 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1241 transitions. [2020-11-29 23:55:54,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-11-29 23:55:54,303 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 23:55:54,303 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-29 23:55:54,303 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 23:55:54,304 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 23:55:54,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 23:55:54,304 INFO L82 PathProgramCache]: Analyzing trace with hash -344264110, now seen corresponding path program 2 times [2020-11-29 23:55:54,304 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 23:55:54,305 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617856900] [2020-11-29 23:55:54,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 23:55:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:55:54,369 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:55:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 23:55:54,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 23:55:54,512 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 23:55:54,513 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 23:55:54,513 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 23:55:54,551 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-29 23:55:54,551 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,551 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-29 23:55:54,552 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-11-29 23:55:54,555 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-29 23:55:54,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,555 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-29 23:55:54,555 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,555 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-29 23:55:54,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,556 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-29 23:55:54,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,556 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-29 23:55:54,556 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,558 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-29 23:55:54,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,558 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-29 23:55:54,558 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,559 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-29 23:55:54,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,559 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-29 23:55:54,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,559 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-29 23:55:54,559 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,560 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-29 23:55:54,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,561 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-29 23:55:54,561 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,562 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-29 23:55:54,562 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,562 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-29 23:55:54,563 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,567 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-29 23:55:54,567 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,568 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-29 23:55:54,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,568 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-29 23:55:54,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,568 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-29 23:55:54,568 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,569 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-29 23:55:54,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,569 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-29 23:55:54,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,569 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-29 23:55:54,569 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,570 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-29 23:55:54,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,570 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-29 23:55:54,570 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,570 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-29 23:55:54,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,571 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-29 23:55:54,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,571 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-29 23:55:54,571 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,571 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-29 23:55:54,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,572 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-29 23:55:54,572 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,573 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-29 23:55:54,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,573 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-29 23:55:54,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,573 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-29 23:55:54,573 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,574 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-29 23:55:54,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,574 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-29 23:55:54,574 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,575 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-29 23:55:54,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,575 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-29 23:55:54,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,575 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-29 23:55:54,575 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,576 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-29 23:55:54,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,576 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-29 23:55:54,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,576 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-29 23:55:54,576 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 11:55:54 BasicIcfg [2020-11-29 23:55:54,688 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 23:55:54,689 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 23:55:54,689 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 23:55:54,690 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 23:55:54,690 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 11:55:40" (3/4) ... [2020-11-29 23:55:54,692 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 23:55:54,718 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-29 23:55:54,718 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,719 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-29 23:55:54,719 WARN L224 RCFGBacktranslator]: unable to determine which branch was taken at C: __VERIFIER_atomic_begin() [753] [2020-11-29 23:55:54,719 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-29 23:55:54,719 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,720 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-29 23:55:54,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,720 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-29 23:55:54,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,720 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-29 23:55:54,720 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,720 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-29 23:55:54,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,721 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-29 23:55:54,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,721 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-29 23:55:54,721 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,722 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-29 23:55:54,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,722 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-29 23:55:54,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,722 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-29 23:55:54,722 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,723 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-29 23:55:54,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,723 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-29 23:55:54,723 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,723 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-29 23:55:54,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,724 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-29 23:55:54,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,724 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-29 23:55:54,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,724 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-29 23:55:54,724 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,725 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-29 23:55:54,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,725 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-29 23:55:54,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,725 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-29 23:55:54,725 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,725 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-29 23:55:54,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,726 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-29 23:55:54,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,726 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-29 23:55:54,726 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,726 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-29 23:55:54,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,727 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-29 23:55:54,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,727 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-29 23:55:54,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,727 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-29 23:55:54,727 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,728 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-29 23:55:54,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,728 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-29 23:55:54,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,728 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-29 23:55:54,728 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,729 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-29 23:55:54,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,729 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-29 23:55:54,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,729 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-29 23:55:54,729 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,729 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-29 23:55:54,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,730 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-29 23:55:54,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,730 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-29 23:55:54,730 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,730 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-29 23:55:54,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,731 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-29 23:55:54,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,731 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-29 23:55:54,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,731 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-29 23:55:54,731 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-11-29 23:55:54,863 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_baa8be7f-934c-4be7-a176-33b4b71837d7/bin/uautomizer/witness.graphml [2020-11-29 23:55:54,863 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 23:55:54,864 INFO L168 Benchmark]: Toolchain (without parser) took 18392.37 ms. Allocated memory was 121.6 MB in the beginning and 629.1 MB in the end (delta: 507.5 MB). Free memory was 92.0 MB in the beginning and 322.9 MB in the end (delta: -230.9 MB). Peak memory consumption was 275.6 MB. Max. memory is 16.1 GB. [2020-11-29 23:55:54,865 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 83.9 MB. Free memory was 43.6 MB in the beginning and 43.5 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 23:55:54,865 INFO L168 Benchmark]: CACSL2BoogieTranslator took 805.37 ms. Allocated memory is still 121.6 MB. Free memory was 91.7 MB in the beginning and 73.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. [2020-11-29 23:55:54,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.66 ms. Allocated memory is still 121.6 MB. Free memory was 73.0 MB in the beginning and 70.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:55:54,866 INFO L168 Benchmark]: Boogie Preprocessor took 40.50 ms. Allocated memory is still 121.6 MB. Free memory was 70.8 MB in the beginning and 68.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 23:55:54,866 INFO L168 Benchmark]: RCFGBuilder took 3139.91 ms. Allocated memory was 121.6 MB in the beginning and 151.0 MB in the end (delta: 29.4 MB). Free memory was 68.1 MB in the beginning and 74.0 MB in the end (delta: -5.9 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. [2020-11-29 23:55:54,867 INFO L168 Benchmark]: TraceAbstraction took 14128.98 ms. Allocated memory was 151.0 MB in the beginning and 629.1 MB in the end (delta: 478.2 MB). Free memory was 74.0 MB in the beginning and 353.3 MB in the end (delta: -279.4 MB). Peak memory consumption was 198.8 MB. Max. memory is 16.1 GB. [2020-11-29 23:55:54,867 INFO L168 Benchmark]: Witness Printer took 173.98 ms. Allocated memory is still 629.1 MB. Free memory was 353.3 MB in the beginning and 322.9 MB in the end (delta: 30.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-29 23:55:54,869 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.21 ms. Allocated memory is still 83.9 MB. Free memory was 43.6 MB in the beginning and 43.5 MB in the end (delta: 71.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 805.37 ms. Allocated memory is still 121.6 MB. Free memory was 91.7 MB in the beginning and 73.0 MB in the end (delta: 18.7 MB). Peak memory consumption was 18.9 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 91.66 ms. Allocated memory is still 121.6 MB. Free memory was 73.0 MB in the beginning and 70.8 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 40.50 ms. Allocated memory is still 121.6 MB. Free memory was 70.8 MB in the beginning and 68.1 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3139.91 ms. Allocated memory was 121.6 MB in the beginning and 151.0 MB in the end (delta: 29.4 MB). Free memory was 68.1 MB in the beginning and 74.0 MB in the end (delta: -5.9 MB). Peak memory consumption was 51.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14128.98 ms. Allocated memory was 151.0 MB in the beginning and 629.1 MB in the end (delta: 478.2 MB). Free memory was 74.0 MB in the beginning and 353.3 MB in the end (delta: -279.4 MB). Peak memory consumption was 198.8 MB. Max. memory is 16.1 GB. * Witness Printer took 173.98 ms. Allocated memory is still 629.1 MB. Free memory was 353.3 MB in the beginning and 322.9 MB in the end (delta: 30.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2132 VarBasedMoverChecksPositive, 86 VarBasedMoverChecksNegative, 25 SemBasedMoverChecksPositive, 61 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 251 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 6.0s, 134 PlacesBefore, 48 PlacesAfterwards, 124 TransitionsBefore, 36 TransitionsAfterwards, 3124 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 52 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 2 ChoiceCompositions, 106 TotalNumberOfCompositions, 9364 MoverChecksTotal - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L18] COND TRUE 1 !expression [L17] COND FALSE 1 !(0) [L17] 1 __assert_fail ("0", "mix037_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] EXPR 2 b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L799] 2 return 0; [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] EXPR 3 b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 [L877] 0 pthread_t t972; [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L819] 3 return 0; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 [L830] 4 __unbuffered_p3_EAX = a VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1 [L837] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] EXPR 4 weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1) [L839] EXPR 4 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] EXPR 4 weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] EXPR 4 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] EXPR 4 weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0 [L843] EXPR 4 !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L843] EXPR 4 weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] EXPR 4 b$flush_delayed ? b$mem_tmp : b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] [L849] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] EXPR 4 b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] EXPR 1 b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b [L770] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L779] 1 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] [L3] COND FALSE 0 !(!cond) [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] EXPR 0 b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b [L884] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] EXPR 0 b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix037_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 122 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 13.8s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.5s, HoareTripleCheckerStatistics: 443 SDtfs, 970 SDslu, 1359 SDs, 0 SdLazy, 891 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5774occurred 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: 1.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 1176 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 30263 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...