./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/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 cee501b026c787e98ad598ca126044a1e41e805c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-69874e2 [2020-12-01 15:00:58,265 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 15:00:58,268 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 15:00:58,314 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 15:00:58,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 15:00:58,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 15:00:58,321 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 15:00:58,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 15:00:58,337 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 15:00:58,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 15:00:58,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 15:00:58,345 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 15:00:58,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 15:00:58,353 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 15:00:58,355 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 15:00:58,358 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 15:00:58,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 15:00:58,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 15:00:58,368 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 15:00:58,377 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 15:00:58,379 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 15:00:58,381 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 15:00:58,382 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 15:00:58,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 15:00:58,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 15:00:58,392 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 15:00:58,392 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 15:00:58,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 15:00:58,394 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 15:00:58,396 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 15:00:58,396 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 15:00:58,397 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 15:00:58,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 15:00:58,400 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 15:00:58,401 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 15:00:58,401 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 15:00:58,402 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 15:00:58,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 15:00:58,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 15:00:58,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 15:00:58,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 15:00:58,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 15:00:58,432 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 15:00:58,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 15:00:58,434 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 15:00:58,434 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 15:00:58,435 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 15:00:58,435 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 15:00:58,437 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 15:00:58,438 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 15:00:58,438 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 15:00:58,439 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 15:00:58,439 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 15:00:58,439 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 15:00:58,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 15:00:58,440 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 15:00:58,440 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 15:00:58,441 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 15:00:58,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 15:00:58,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 15:00:58,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 15:00:58,442 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 15:00:58,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 15:00:58,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 15:00:58,443 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 15:00:58,443 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 15:00:58,444 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 15:00:58,444 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 15:00:58,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 15:00:58,445 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 15:00:58,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 15:00:58,445 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_b6b7d0f5-6f79-42ad-8085-b0148b266229/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_b6b7d0f5-6f79-42ad-8085-b0148b266229/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 -> cee501b026c787e98ad598ca126044a1e41e805c [2020-12-01 15:00:58,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 15:00:58,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 15:00:58,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 15:00:58,796 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 15:00:58,797 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 15:00:58,798 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc.i [2020-12-01 15:00:58,895 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/data/2ea2a15e4/a3543d4ddf0048beb56fe206678fccda/FLAGc065cb93a [2020-12-01 15:00:59,543 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 15:00:59,544 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/sv-benchmarks/c/pthread-wmm/mix008_power.oepc.i [2020-12-01 15:00:59,562 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/data/2ea2a15e4/a3543d4ddf0048beb56fe206678fccda/FLAGc065cb93a [2020-12-01 15:00:59,749 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/data/2ea2a15e4/a3543d4ddf0048beb56fe206678fccda [2020-12-01 15:00:59,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 15:00:59,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 15:00:59,755 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 15:00:59,755 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 15:00:59,759 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 15:00:59,760 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:00:59" (1/1) ... [2020-12-01 15:00:59,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34620e6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:00:59, skipping insertion in model container [2020-12-01 15:00:59,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 03:00:59" (1/1) ... [2020-12-01 15:00:59,778 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 15:00:59,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 15:01:00,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:01:00,477 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 15:01:00,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 15:01:00,743 INFO L208 MainTranslator]: Completed translation [2020-12-01 15:01:00,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00 WrapperNode [2020-12-01 15:01:00,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 15:01:00,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 15:01:00,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 15:01:00,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 15:01:00,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,778 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,813 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 15:01:00,814 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 15:01:00,814 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 15:01:00,814 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 15:01:00,824 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,824 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,831 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... [2020-12-01 15:01:00,895 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 15:01:00,896 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 15:01:00,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 15:01:00,897 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 15:01:00,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/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-12-01 15:01:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-01 15:01:00,989 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-01 15:01:00,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 15:01:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-01 15:01:00,991 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-01 15:01:00,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-01 15:01:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-01 15:01:00,994 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-01 15:01:00,994 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-01 15:01:00,995 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-01 15:01:00,995 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-12-01 15:01:00,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-12-01 15:01:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 15:01:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-01 15:01:00,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 15:01:00,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 15:01:00,999 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-01 15:01:03,917 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 15:01:03,918 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-01 15:01:03,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:01:03 BoogieIcfgContainer [2020-12-01 15:01:03,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 15:01:03,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 15:01:03,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 15:01:03,929 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 15:01:03,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 03:00:59" (1/3) ... [2020-12-01 15:01:03,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c3db71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:01:03, skipping insertion in model container [2020-12-01 15:01:03,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 03:01:00" (2/3) ... [2020-12-01 15:01:03,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63c3db71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 03:01:03, skipping insertion in model container [2020-12-01 15:01:03,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:01:03" (3/3) ... [2020-12-01 15:01:03,933 INFO L111 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc.i [2020-12-01 15:01:03,955 WARN L169 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-01 15:01:03,955 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 15:01:03,959 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-01 15:01:03,961 INFO L354 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-01 15:01:04,029 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,030 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,030 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,031 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,031 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,031 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,032 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,032 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,033 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,033 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,034 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,034 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,035 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,036 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,037 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,038 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,038 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,039 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,040 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,041 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,042 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,043 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,044 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,045 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,045 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,045 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,046 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,046 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,046 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,050 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,051 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,052 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,053 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,054 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,055 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,056 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,057 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,058 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,059 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,059 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,060 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,061 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,062 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,063 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,064 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,067 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,068 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,069 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,070 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,071 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,071 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,088 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,088 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,088 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,091 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,100 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,101 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,101 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,101 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,102 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,103 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,104 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,105 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,106 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,107 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,109 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,110 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,113 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,114 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,115 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,116 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,117 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,118 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,119 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,120 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,121 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,124 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,125 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,126 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,127 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,128 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,129 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,132 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,137 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,138 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,139 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,139 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,147 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,150 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,151 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,151 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,151 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,152 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,153 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,154 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,155 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,156 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,171 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,172 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,173 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,174 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,175 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,176 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,178 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,178 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,179 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,180 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,181 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,181 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,182 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-01 15:01:04,183 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-01 15:01:04,197 INFO L253 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-12-01 15:01:04,240 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 15:01:04,244 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 15:01:04,244 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 15:01:04,244 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 15:01:04,244 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 15:01:04,245 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 15:01:04,245 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 15:01:04,245 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 15:01:04,265 INFO L120 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-12-01 15:01:04,268 INFO L135 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 133 places, 123 transitions, 266 flow [2020-12-01 15:01:04,272 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 133 places, 123 transitions, 266 flow [2020-12-01 15:01:04,274 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 133 places, 123 transitions, 266 flow [2020-12-01 15:01:04,375 INFO L129 PetriNetUnfolder]: 3/119 cut-off events. [2020-12-01 15:01:04,375 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-12-01 15:01:04,394 INFO L84 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 119 events. 3/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 101 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 82. Up to 2 conditions per place. [2020-12-01 15:01:04,408 INFO L116 LiptonReduction]: Number of co-enabled transitions 3134 [2020-12-01 15:01:04,937 WARN L197 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2020-12-01 15:01:05,071 WARN L197 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2020-12-01 15:01:05,291 WARN L197 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2020-12-01 15:01:06,074 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,075 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,121 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:06,121 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:06,128 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:01:06,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:06,136 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:06,138 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:06,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:06,143 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:06,147 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:06,148 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:06,151 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:06,151 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:06,310 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:06,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-01 15:01:06,318 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:06,319 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:06,373 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,374 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,376 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,376 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,380 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,381 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,384 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,385 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,420 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,420 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,421 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,422 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,425 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,426 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,430 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,431 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,588 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,589 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,590 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,591 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,593 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,598 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,602 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,602 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,636 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,636 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,637 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,638 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,641 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,642 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,646 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,647 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,690 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,691 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,700 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,700 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,703 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,704 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,706 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,706 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,730 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,731 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,731 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,732 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,735 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,735 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,738 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,739 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,949 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,950 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,951 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,951 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,957 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:06,993 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,993 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:06,995 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:06,999 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,003 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,004 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,123 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,124 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,125 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,125 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,131 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,132 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,135 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,135 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,173 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,173 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,174 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,174 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,177 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,177 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,180 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,180 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,236 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,237 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,238 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,240 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,240 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,243 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,244 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,273 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,274 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,274 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,277 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,489 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,489 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,490 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,490 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,493 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,493 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,496 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,496 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,559 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,560 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,561 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,561 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,563 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,564 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,567 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,567 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,765 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:07,766 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-12-01 15:01:07,769 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 8, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:07,770 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:07,820 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,821 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,858 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:07,858 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:07,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:01:07,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:07,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:07,863 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:07,865 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:07,865 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:07,867 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:07,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:07,869 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:07,869 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:07,926 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,927 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,928 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,928 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,930 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,930 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,933 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,933 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,956 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,957 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,958 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,959 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:07,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:07,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:07,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:09,740 WARN L197 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-12-01 15:01:09,863 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-12-01 15:01:10,347 WARN L197 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 83 [2020-12-01 15:01:10,365 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 3, 2, 1] term [2020-12-01 15:01:10,366 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:10,738 WARN L197 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 85 [2020-12-01 15:01:10,784 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 3, 3, 2, 2, 1] term [2020-12-01 15:01:10,784 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:10,886 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,886 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:10,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:10,889 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,890 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:10,892 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,892 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:10,910 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,911 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:10,912 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,912 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:10,914 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,914 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:10,916 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:10,916 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,257 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,258 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,259 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,259 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,261 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,261 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,263 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,263 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,279 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,280 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,280 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,282 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,283 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,285 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,285 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,347 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,348 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,348 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,349 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,350 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,355 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,355 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,397 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,397 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,398 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,398 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,400 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,400 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,402 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,402 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,645 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,646 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,651 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:11,651 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:11,653 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:01:11,653 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:11,654 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:11,655 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:11,657 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:11,657 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,659 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:11,660 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,661 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:11,662 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,710 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:11,711 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:01:11,713 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:11,714 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,751 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,751 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,752 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,753 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,754 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,755 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,757 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,757 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,776 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,776 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,777 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,778 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,780 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,780 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,782 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,783 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,860 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,861 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,862 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,862 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,864 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,864 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,866 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,867 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,887 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,887 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,888 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,888 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,890 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,891 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,893 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,934 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,935 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,936 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,936 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,938 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,939 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,941 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,941 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:11,960 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,961 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,961 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,962 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,964 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,964 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,966 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,967 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:11,994 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,994 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,995 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,996 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:11,997 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:11,998 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:12,000 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,000 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:12,021 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,022 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,023 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,024 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,030 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,031 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:12,033 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,034 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:12,142 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:12,142 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-12-01 15:01:12,145 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 7, 2, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:12,145 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,202 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,203 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,205 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:12,205 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:12,207 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-12-01 15:01:12,207 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:12,209 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-12-01 15:01:12,209 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-12-01 15:01:12,211 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:12,212 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:12,214 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:12,214 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:12,215 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 5, 3, 4, 3, 4, 3, 2, 1] term [2020-12-01 15:01:12,216 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:12,250 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,251 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,252 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,252 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,254 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,254 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:12,256 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-12-01 15:01:12,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,276 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,277 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-12-01 15:01:12,278 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,279 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:12,281 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 5, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-12-01 15:01:12,281 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-12-01 15:01:13,063 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 34 [2020-12-01 15:01:14,396 WARN L197 SmtUtils]: Spent 141.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-01 15:01:14,544 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-01 15:01:14,679 WARN L197 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2020-12-01 15:01:15,434 WARN L197 SmtUtils]: Spent 540.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-01 15:01:15,720 WARN L197 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-01 15:01:16,150 WARN L197 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 124 [2020-12-01 15:01:16,377 WARN L197 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2020-12-01 15:01:16,429 INFO L131 LiptonReduction]: Checked pairs total: 11023 [2020-12-01 15:01:16,430 INFO L133 LiptonReduction]: Total number of compositions: 107 [2020-12-01 15:01:16,436 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2020-12-01 15:01:16,924 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 5834 states. [2020-12-01 15:01:16,926 INFO L276 IsEmpty]: Start isEmpty. Operand 5834 states. [2020-12-01 15:01:16,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-12-01 15:01:16,931 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:16,932 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-12-01 15:01:16,932 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1253755, now seen corresponding path program 1 times [2020-12-01 15:01:16,948 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:16,949 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353830] [2020-12-01 15:01:16,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:17,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:17,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:17,248 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353830] [2020-12-01 15:01:17,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:17,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:01:17,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729639414] [2020-12-01 15:01:17,257 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:01:17,257 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:17,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:01:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:17,279 INFO L87 Difference]: Start difference. First operand 5834 states. Second operand 3 states. [2020-12-01 15:01:17,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:17,524 INFO L93 Difference]: Finished difference Result 4862 states and 19480 transitions. [2020-12-01 15:01:17,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:01:17,526 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-12-01 15:01:17,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:17,614 INFO L225 Difference]: With dead ends: 4862 [2020-12-01 15:01:17,614 INFO L226 Difference]: Without dead ends: 3962 [2020-12-01 15:01:17,615 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:17,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3962 states. [2020-12-01 15:01:17,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3962 to 3962. [2020-12-01 15:01:17,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3962 states. [2020-12-01 15:01:18,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3962 states to 3962 states and 15640 transitions. [2020-12-01 15:01:18,037 INFO L78 Accepts]: Start accepts. Automaton has 3962 states and 15640 transitions. Word has length 3 [2020-12-01 15:01:18,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:18,038 INFO L481 AbstractCegarLoop]: Abstraction has 3962 states and 15640 transitions. [2020-12-01 15:01:18,038 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:01:18,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3962 states and 15640 transitions. [2020-12-01 15:01:18,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-12-01 15:01:18,044 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:18,045 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:01:18,045 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 15:01:18,045 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:18,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1853502558, now seen corresponding path program 1 times [2020-12-01 15:01:18,051 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:18,052 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134857145] [2020-12-01 15:01:18,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:18,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:18,212 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134857145] [2020-12-01 15:01:18,212 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:18,212 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:01:18,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372243934] [2020-12-01 15:01:18,214 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:01:18,214 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:18,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:01:18,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:18,215 INFO L87 Difference]: Start difference. First operand 3962 states and 15640 transitions. Second operand 3 states. [2020-12-01 15:01:18,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:18,262 INFO L93 Difference]: Finished difference Result 3662 states and 14310 transitions. [2020-12-01 15:01:18,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:01:18,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-12-01 15:01:18,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:18,302 INFO L225 Difference]: With dead ends: 3662 [2020-12-01 15:01:18,302 INFO L226 Difference]: Without dead ends: 3662 [2020-12-01 15:01:18,303 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2020-12-01 15:01:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2020-12-01 15:01:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3662 states. [2020-12-01 15:01:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 14310 transitions. [2020-12-01 15:01:18,457 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 14310 transitions. Word has length 11 [2020-12-01 15:01:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:18,458 INFO L481 AbstractCegarLoop]: Abstraction has 3662 states and 14310 transitions. [2020-12-01 15:01:18,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:01:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 14310 transitions. [2020-12-01 15:01:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-12-01 15:01:18,463 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:18,463 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:01:18,463 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 15:01:18,464 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:18,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:18,464 INFO L82 PathProgramCache]: Analyzing trace with hash -949340064, now seen corresponding path program 1 times [2020-12-01 15:01:18,464 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:18,465 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936707378] [2020-12-01 15:01:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:18,564 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:18,564 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936707378] [2020-12-01 15:01:18,564 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:18,565 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:01:18,565 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356931615] [2020-12-01 15:01:18,565 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:01:18,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:18,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:01:18,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:18,567 INFO L87 Difference]: Start difference. First operand 3662 states and 14310 transitions. Second operand 3 states. [2020-12-01 15:01:18,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:18,619 INFO L93 Difference]: Finished difference Result 3462 states and 13440 transitions. [2020-12-01 15:01:18,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:01:18,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-12-01 15:01:18,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:18,657 INFO L225 Difference]: With dead ends: 3462 [2020-12-01 15:01:18,657 INFO L226 Difference]: Without dead ends: 3462 [2020-12-01 15:01:18,658 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2020-12-01 15:01:18,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3462. [2020-12-01 15:01:18,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3462 states. [2020-12-01 15:01:18,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3462 states to 3462 states and 13440 transitions. [2020-12-01 15:01:18,929 INFO L78 Accepts]: Start accepts. Automaton has 3462 states and 13440 transitions. Word has length 13 [2020-12-01 15:01:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:18,929 INFO L481 AbstractCegarLoop]: Abstraction has 3462 states and 13440 transitions. [2020-12-01 15:01:18,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:01:18,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3462 states and 13440 transitions. [2020-12-01 15:01:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-12-01 15:01:18,944 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:18,944 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:01:18,945 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 15:01:18,945 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:18,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:18,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1801903524, now seen corresponding path program 1 times [2020-12-01 15:01:18,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:18,947 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847531920] [2020-12-01 15:01:18,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:19,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:19,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:19,036 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847531920] [2020-12-01 15:01:19,037 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:19,037 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-12-01 15:01:19,037 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586601843] [2020-12-01 15:01:19,037 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:01:19,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:19,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:01:19,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:19,039 INFO L87 Difference]: Start difference. First operand 3462 states and 13440 transitions. Second operand 3 states. [2020-12-01 15:01:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:19,082 INFO L93 Difference]: Finished difference Result 3430 states and 13296 transitions. [2020-12-01 15:01:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:01:19,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-12-01 15:01:19,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:19,114 INFO L225 Difference]: With dead ends: 3430 [2020-12-01 15:01:19,114 INFO L226 Difference]: Without dead ends: 3430 [2020-12-01 15:01:19,115 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3430 states. [2020-12-01 15:01:19,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3430 to 3430. [2020-12-01 15:01:19,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3430 states. [2020-12-01 15:01:19,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3430 states to 3430 states and 13296 transitions. [2020-12-01 15:01:19,270 INFO L78 Accepts]: Start accepts. Automaton has 3430 states and 13296 transitions. Word has length 15 [2020-12-01 15:01:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:19,271 INFO L481 AbstractCegarLoop]: Abstraction has 3430 states and 13296 transitions. [2020-12-01 15:01:19,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:01:19,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3430 states and 13296 transitions. [2020-12-01 15:01:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-12-01 15:01:19,276 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:19,276 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:01:19,276 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 15:01:19,277 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:19,277 INFO L82 PathProgramCache]: Analyzing trace with hash 854587980, now seen corresponding path program 1 times [2020-12-01 15:01:19,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:19,278 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180645807] [2020-12-01 15:01:19,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:19,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:19,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:19,410 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180645807] [2020-12-01 15:01:19,411 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:19,411 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:01:19,411 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359316491] [2020-12-01 15:01:19,411 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:01:19,411 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:19,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:01:19,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:01:19,412 INFO L87 Difference]: Start difference. First operand 3430 states and 13296 transitions. Second operand 4 states. [2020-12-01 15:01:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:19,478 INFO L93 Difference]: Finished difference Result 3404 states and 12006 transitions. [2020-12-01 15:01:19,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 15:01:19,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2020-12-01 15:01:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:19,490 INFO L225 Difference]: With dead ends: 3404 [2020-12-01 15:01:19,490 INFO L226 Difference]: Without dead ends: 2504 [2020-12-01 15:01:19,491 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:01:19,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2020-12-01 15:01:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2504. [2020-12-01 15:01:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2020-12-01 15:01:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 8666 transitions. [2020-12-01 15:01:19,577 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 8666 transitions. Word has length 16 [2020-12-01 15:01:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:19,578 INFO L481 AbstractCegarLoop]: Abstraction has 2504 states and 8666 transitions. [2020-12-01 15:01:19,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:01:19,578 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 8666 transitions. [2020-12-01 15:01:19,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 15:01:19,584 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:19,584 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:01:19,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 15:01:19,584 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:19,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:19,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1317164941, now seen corresponding path program 1 times [2020-12-01 15:01:19,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:19,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197557968] [2020-12-01 15:01:19,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:19,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:19,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197557968] [2020-12-01 15:01:19,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:19,634 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:01:19,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085271054] [2020-12-01 15:01:19,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:01:19,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:19,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:01:19,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:19,636 INFO L87 Difference]: Start difference. First operand 2504 states and 8666 transitions. Second operand 3 states. [2020-12-01 15:01:19,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:19,668 INFO L93 Difference]: Finished difference Result 3749 states and 12705 transitions. [2020-12-01 15:01:19,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:01:19,669 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2020-12-01 15:01:19,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:19,679 INFO L225 Difference]: With dead ends: 3749 [2020-12-01 15:01:19,680 INFO L226 Difference]: Without dead ends: 2585 [2020-12-01 15:01:19,680 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:19,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2585 states. [2020-12-01 15:01:19,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2585 to 2474. [2020-12-01 15:01:19,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2474 states. [2020-12-01 15:01:19,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2474 states to 2474 states and 8218 transitions. [2020-12-01 15:01:19,829 INFO L78 Accepts]: Start accepts. Automaton has 2474 states and 8218 transitions. Word has length 19 [2020-12-01 15:01:19,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:19,830 INFO L481 AbstractCegarLoop]: Abstraction has 2474 states and 8218 transitions. [2020-12-01 15:01:19,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:01:19,830 INFO L276 IsEmpty]: Start isEmpty. Operand 2474 states and 8218 transitions. [2020-12-01 15:01:19,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-12-01 15:01:19,836 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:19,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-12-01 15:01:19,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 15:01:19,836 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:19,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:19,837 INFO L82 PathProgramCache]: Analyzing trace with hash -553748255, now seen corresponding path program 1 times [2020-12-01 15:01:19,837 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:19,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743071181] [2020-12-01 15:01:19,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:19,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:19,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:19,919 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743071181] [2020-12-01 15:01:19,920 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:19,920 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 15:01:19,920 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361487274] [2020-12-01 15:01:19,920 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 15:01:19,921 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:19,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 15:01:19,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:01:19,922 INFO L87 Difference]: Start difference. First operand 2474 states and 8218 transitions. Second operand 5 states. [2020-12-01 15:01:20,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:20,008 INFO L93 Difference]: Finished difference Result 2119 states and 6539 transitions. [2020-12-01 15:01:20,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:01:20,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-12-01 15:01:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:20,015 INFO L225 Difference]: With dead ends: 2119 [2020-12-01 15:01:20,015 INFO L226 Difference]: Without dead ends: 1619 [2020-12-01 15:01:20,016 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:01:20,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1619 states. [2020-12-01 15:01:20,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1619 to 1619. [2020-12-01 15:01:20,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2020-12-01 15:01:20,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 4908 transitions. [2020-12-01 15:01:20,069 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 4908 transitions. Word has length 19 [2020-12-01 15:01:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:20,069 INFO L481 AbstractCegarLoop]: Abstraction has 1619 states and 4908 transitions. [2020-12-01 15:01:20,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 15:01:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 4908 transitions. [2020-12-01 15:01:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 15:01:20,074 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:20,074 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] [2020-12-01 15:01:20,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 15:01:20,075 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:20,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:20,075 INFO L82 PathProgramCache]: Analyzing trace with hash 623122690, now seen corresponding path program 1 times [2020-12-01 15:01:20,075 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:20,076 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712147132] [2020-12-01 15:01:20,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:20,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:20,155 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712147132] [2020-12-01 15:01:20,155 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:20,155 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-01 15:01:20,160 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056812098] [2020-12-01 15:01:20,161 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 15:01:20,161 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:20,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 15:01:20,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:20,162 INFO L87 Difference]: Start difference. First operand 1619 states and 4908 transitions. Second operand 3 states. [2020-12-01 15:01:20,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:20,187 INFO L93 Difference]: Finished difference Result 2448 states and 7255 transitions. [2020-12-01 15:01:20,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 15:01:20,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-12-01 15:01:20,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:20,194 INFO L225 Difference]: With dead ends: 2448 [2020-12-01 15:01:20,194 INFO L226 Difference]: Without dead ends: 1652 [2020-12-01 15:01:20,195 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 15:01:20,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1652 states. [2020-12-01 15:01:20,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1652 to 1619. [2020-12-01 15:01:20,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1619 states. [2020-12-01 15:01:20,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1619 states to 1619 states and 4680 transitions. [2020-12-01 15:01:20,247 INFO L78 Accepts]: Start accepts. Automaton has 1619 states and 4680 transitions. Word has length 22 [2020-12-01 15:01:20,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:20,247 INFO L481 AbstractCegarLoop]: Abstraction has 1619 states and 4680 transitions. [2020-12-01 15:01:20,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 15:01:20,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1619 states and 4680 transitions. [2020-12-01 15:01:20,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-12-01 15:01:20,252 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:20,252 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] [2020-12-01 15:01:20,253 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 15:01:20,253 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:20,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:20,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1095786696, now seen corresponding path program 1 times [2020-12-01 15:01:20,254 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:20,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034395592] [2020-12-01 15:01:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:20,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:20,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034395592] [2020-12-01 15:01:20,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:20,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:01:20,468 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403737320] [2020-12-01 15:01:20,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 15:01:20,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:20,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 15:01:20,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 15:01:20,469 INFO L87 Difference]: Start difference. First operand 1619 states and 4680 transitions. Second operand 6 states. [2020-12-01 15:01:20,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:20,557 INFO L93 Difference]: Finished difference Result 1454 states and 4170 transitions. [2020-12-01 15:01:20,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:01:20,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2020-12-01 15:01:20,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:20,563 INFO L225 Difference]: With dead ends: 1454 [2020-12-01 15:01:20,563 INFO L226 Difference]: Without dead ends: 1234 [2020-12-01 15:01:20,564 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:01:20,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-12-01 15:01:20,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1234. [2020-12-01 15:01:20,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1234 states. [2020-12-01 15:01:20,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1234 states to 1234 states and 3547 transitions. [2020-12-01 15:01:20,633 INFO L78 Accepts]: Start accepts. Automaton has 1234 states and 3547 transitions. Word has length 22 [2020-12-01 15:01:20,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:20,636 INFO L481 AbstractCegarLoop]: Abstraction has 1234 states and 3547 transitions. [2020-12-01 15:01:20,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 15:01:20,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1234 states and 3547 transitions. [2020-12-01 15:01:20,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 15:01:20,640 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:20,640 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-12-01 15:01:20,640 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 15:01:20,640 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:20,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:20,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1532835601, now seen corresponding path program 1 times [2020-12-01 15:01:20,641 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:20,641 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843819365] [2020-12-01 15:01:20,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:20,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:20,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843819365] [2020-12-01 15:01:20,728 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:20,728 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 15:01:20,728 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478899330] [2020-12-01 15:01:20,728 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 15:01:20,729 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:20,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 15:01:20,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 15:01:20,729 INFO L87 Difference]: Start difference. First operand 1234 states and 3547 transitions. Second operand 4 states. [2020-12-01 15:01:20,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:20,757 INFO L93 Difference]: Finished difference Result 1612 states and 4529 transitions. [2020-12-01 15:01:20,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 15:01:20,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-12-01 15:01:20,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:20,761 INFO L225 Difference]: With dead ends: 1612 [2020-12-01 15:01:20,762 INFO L226 Difference]: Without dead ends: 1057 [2020-12-01 15:01:20,763 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 15:01:20,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1057 states. [2020-12-01 15:01:20,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1057 to 1054. [2020-12-01 15:01:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2020-12-01 15:01:20,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 2890 transitions. [2020-12-01 15:01:20,794 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 2890 transitions. Word has length 25 [2020-12-01 15:01:20,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:20,795 INFO L481 AbstractCegarLoop]: Abstraction has 1054 states and 2890 transitions. [2020-12-01 15:01:20,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 15:01:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 2890 transitions. [2020-12-01 15:01:20,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-12-01 15:01:20,798 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:20,799 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-12-01 15:01:20,799 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 15:01:20,799 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:20,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:20,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1145179473, now seen corresponding path program 2 times [2020-12-01 15:01:20,800 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:20,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068879108] [2020-12-01 15:01:20,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:20,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:20,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:20,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068879108] [2020-12-01 15:01:20,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:20,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:01:20,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129877543] [2020-12-01 15:01:20,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:01:20,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:20,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:01:20,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:01:20,981 INFO L87 Difference]: Start difference. First operand 1054 states and 2890 transitions. Second operand 7 states. [2020-12-01 15:01:21,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:21,062 INFO L93 Difference]: Finished difference Result 1024 states and 2831 transitions. [2020-12-01 15:01:21,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-12-01 15:01:21,063 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-12-01 15:01:21,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:21,064 INFO L225 Difference]: With dead ends: 1024 [2020-12-01 15:01:21,064 INFO L226 Difference]: Without dead ends: 370 [2020-12-01 15:01:21,064 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:01:21,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-01 15:01:21,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2020-12-01 15:01:21,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-12-01 15:01:21,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1021 transitions. [2020-12-01 15:01:21,074 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1021 transitions. Word has length 25 [2020-12-01 15:01:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:21,075 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 1021 transitions. [2020-12-01 15:01:21,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:01:21,075 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1021 transitions. [2020-12-01 15:01:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-01 15:01:21,077 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:21,077 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-12-01 15:01:21,077 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 15:01:21,077 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:21,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:21,078 INFO L82 PathProgramCache]: Analyzing trace with hash -485039972, now seen corresponding path program 1 times [2020-12-01 15:01:21,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:21,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268756356] [2020-12-01 15:01:21,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:21,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:21,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268756356] [2020-12-01 15:01:21,241 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:21,241 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 15:01:21,242 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640559337] [2020-12-01 15:01:21,242 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-01 15:01:21,242 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:21,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-01 15:01:21,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-01 15:01:21,243 INFO L87 Difference]: Start difference. First operand 370 states and 1021 transitions. Second operand 7 states. [2020-12-01 15:01:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:21,481 INFO L93 Difference]: Finished difference Result 426 states and 1158 transitions. [2020-12-01 15:01:21,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 15:01:21,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2020-12-01 15:01:21,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:21,484 INFO L225 Difference]: With dead ends: 426 [2020-12-01 15:01:21,484 INFO L226 Difference]: Without dead ends: 370 [2020-12-01 15:01:21,484 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-01 15:01:21,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2020-12-01 15:01:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2020-12-01 15:01:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 370 states. [2020-12-01 15:01:21,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 1015 transitions. [2020-12-01 15:01:21,495 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 1015 transitions. Word has length 29 [2020-12-01 15:01:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:21,496 INFO L481 AbstractCegarLoop]: Abstraction has 370 states and 1015 transitions. [2020-12-01 15:01:21,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-12-01 15:01:21,496 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 1015 transitions. [2020-12-01 15:01:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-01 15:01:21,497 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:21,498 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-12-01 15:01:21,498 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 15:01:21,498 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:21,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:21,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1278496830, now seen corresponding path program 2 times [2020-12-01 15:01:21,499 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:21,504 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004286091] [2020-12-01 15:01:21,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:21,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:21,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:21,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004286091] [2020-12-01 15:01:21,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:21,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:01:21,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958416311] [2020-12-01 15:01:21,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:01:21,924 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:21,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:01:21,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:01:21,925 INFO L87 Difference]: Start difference. First operand 370 states and 1015 transitions. Second operand 8 states. [2020-12-01 15:01:22,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:22,156 INFO L93 Difference]: Finished difference Result 583 states and 1548 transitions. [2020-12-01 15:01:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:01:22,156 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-12-01 15:01:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:22,158 INFO L225 Difference]: With dead ends: 583 [2020-12-01 15:01:22,158 INFO L226 Difference]: Without dead ends: 365 [2020-12-01 15:01:22,158 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:01:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2020-12-01 15:01:22,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 314. [2020-12-01 15:01:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2020-12-01 15:01:22,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 835 transitions. [2020-12-01 15:01:22,169 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 835 transitions. Word has length 29 [2020-12-01 15:01:22,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:22,169 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 835 transitions. [2020-12-01 15:01:22,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:01:22,169 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 835 transitions. [2020-12-01 15:01:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-01 15:01:22,171 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:22,171 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-12-01 15:01:22,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 15:01:22,171 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:22,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:22,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1285050106, now seen corresponding path program 3 times [2020-12-01 15:01:22,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:22,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718767501] [2020-12-01 15:01:22,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:22,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 15:01:22,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 15:01:22,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718767501] [2020-12-01 15:01:22,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 15:01:22,511 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 15:01:22,511 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559010632] [2020-12-01 15:01:22,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-01 15:01:22,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 15:01:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-01 15:01:22,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-12-01 15:01:22,512 INFO L87 Difference]: Start difference. First operand 314 states and 835 transitions. Second operand 8 states. [2020-12-01 15:01:22,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 15:01:22,685 INFO L93 Difference]: Finished difference Result 380 states and 989 transitions. [2020-12-01 15:01:22,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 15:01:22,686 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2020-12-01 15:01:22,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 15:01:22,687 INFO L225 Difference]: With dead ends: 380 [2020-12-01 15:01:22,687 INFO L226 Difference]: Without dead ends: 294 [2020-12-01 15:01:22,688 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2020-12-01 15:01:22,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2020-12-01 15:01:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2020-12-01 15:01:22,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2020-12-01 15:01:22,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 769 transitions. [2020-12-01 15:01:22,697 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 769 transitions. Word has length 29 [2020-12-01 15:01:22,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 15:01:22,698 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 769 transitions. [2020-12-01 15:01:22,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-12-01 15:01:22,698 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 769 transitions. [2020-12-01 15:01:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-12-01 15:01:22,699 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 15:01:22,699 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-12-01 15:01:22,700 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 15:01:22,700 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 15:01:22,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 15:01:22,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1005739562, now seen corresponding path program 4 times [2020-12-01 15:01:22,701 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 15:01:22,701 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252677774] [2020-12-01 15:01:22,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 15:01:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:01:22,799 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:01:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 15:01:22,899 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 15:01:22,971 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 15:01:22,971 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 15:01:22,972 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 15:01:23,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 03:01:23 BasicIcfg [2020-12-01 15:01:23,203 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 15:01:23,204 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 15:01:23,204 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 15:01:23,204 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 15:01:23,205 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 03:01:03" (3/4) ... [2020-12-01 15:01:23,208 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 15:01:23,410 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b6b7d0f5-6f79-42ad-8085-b0148b266229/bin/uautomizer/witness.graphml [2020-12-01 15:01:23,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 15:01:23,412 INFO L168 Benchmark]: Toolchain (without parser) took 23658.33 ms. Allocated memory was 88.1 MB in the beginning and 585.1 MB in the end (delta: 497.0 MB). Free memory was 61.4 MB in the beginning and 437.6 MB in the end (delta: -376.2 MB). Peak memory consumption was 122.7 MB. Max. memory is 16.1 GB. [2020-12-01 15:01:23,412 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 73.4 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 67.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 15:01:23,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 990.99 ms. Allocated memory is still 88.1 MB. Free memory was 61.3 MB in the beginning and 55.2 MB in the end (delta: 6.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. [2020-12-01 15:01:23,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.65 ms. Allocated memory is still 88.1 MB. Free memory was 55.2 MB in the beginning and 52.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:01:23,413 INFO L168 Benchmark]: Boogie Preprocessor took 81.66 ms. Allocated memory is still 88.1 MB. Free memory was 52.5 MB in the beginning and 50.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:01:23,414 INFO L168 Benchmark]: RCFGBuilder took 3025.06 ms. Allocated memory was 88.1 MB in the beginning and 125.8 MB in the end (delta: 37.7 MB). Free memory was 50.1 MB in the beginning and 50.9 MB in the end (delta: -814.3 kB). Peak memory consumption was 50.1 MB. Max. memory is 16.1 GB. [2020-12-01 15:01:23,414 INFO L168 Benchmark]: TraceAbstraction took 19278.99 ms. Allocated memory was 125.8 MB in the beginning and 585.1 MB in the end (delta: 459.3 MB). Free memory was 49.9 MB in the beginning and 463.8 MB in the end (delta: -413.9 MB). Peak memory consumption was 204.8 MB. Max. memory is 16.1 GB. [2020-12-01 15:01:23,415 INFO L168 Benchmark]: Witness Printer took 206.75 ms. Allocated memory is still 585.1 MB. Free memory was 463.8 MB in the beginning and 437.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. [2020-12-01 15:01:23,418 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.32 ms. Allocated memory is still 73.4 MB. Free memory was 43.3 MB in the beginning and 43.2 MB in the end (delta: 67.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 990.99 ms. Allocated memory is still 88.1 MB. Free memory was 61.3 MB in the beginning and 55.2 MB in the end (delta: 6.1 MB). Peak memory consumption was 31.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.65 ms. Allocated memory is still 88.1 MB. Free memory was 55.2 MB in the beginning and 52.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 81.66 ms. Allocated memory is still 88.1 MB. Free memory was 52.5 MB in the beginning and 50.1 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 3025.06 ms. Allocated memory was 88.1 MB in the beginning and 125.8 MB in the end (delta: 37.7 MB). Free memory was 50.1 MB in the beginning and 50.9 MB in the end (delta: -814.3 kB). Peak memory consumption was 50.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 19278.99 ms. Allocated memory was 125.8 MB in the beginning and 585.1 MB in the end (delta: 459.3 MB). Free memory was 49.9 MB in the beginning and 463.8 MB in the end (delta: -413.9 MB). Peak memory consumption was 204.8 MB. Max. memory is 16.1 GB. * Witness Printer took 206.75 ms. Allocated memory is still 585.1 MB. Free memory was 463.8 MB in the beginning and 437.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 2242 VarBasedMoverChecksPositive, 109 VarBasedMoverChecksNegative, 32 SemBasedMoverChecksPositive, 77 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.8s, 296 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 12.1s, 133 PlacesBefore, 48 PlacesAfterwards, 123 TransitionsBefore, 36 TransitionsAfterwards, 3134 CoEnabledTransitionPairs, 8 FixpointIterations, 41 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 107 TotalNumberOfCompositions, 11023 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_p2_EAX = 0; [L714] 0 int __unbuffered_p2_EBX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L721] 0 _Bool a$flush_delayed; [L722] 0 int a$mem_tmp; [L723] 0 _Bool a$r_buff0_thd0; [L724] 0 _Bool a$r_buff0_thd1; [L725] 0 _Bool a$r_buff0_thd2; [L726] 0 _Bool a$r_buff0_thd3; [L727] 0 _Bool a$r_buff0_thd4; [L728] 0 _Bool a$r_buff1_thd0; [L729] 0 _Bool a$r_buff1_thd1; [L730] 0 _Bool a$r_buff1_thd2; [L731] 0 _Bool a$r_buff1_thd3; [L732] 0 _Bool a$r_buff1_thd4; [L733] 0 _Bool a$read_delayed; [L734] 0 int *a$read_delayed_var; [L735] 0 int a$w_buff0; [L736] 0 _Bool a$w_buff0_used; [L737] 0 int a$w_buff1; [L738] 0 _Bool a$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t209; [L870] FCALL, FORK 0 pthread_create(&t209, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 a$w_buff1 = a$w_buff0 [L753] 1 a$w_buff0 = 1 [L754] 1 a$w_buff1_used = a$w_buff0_used [L755] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L757] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L758] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L759] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L760] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L761] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L871] 0 pthread_t t210; [L872] FCALL, FORK 0 pthread_create(&t210, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L873] 0 pthread_t t211; [L874] FCALL, FORK 0 pthread_create(&t211, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t212; [L876] FCALL, FORK 0 pthread_create(&t212, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L802] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L805] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L808] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L811] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L811] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L812] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L812] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L813] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L813] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L814] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L814] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L815] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L815] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L818] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 3 return 0; [L825] 4 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L828] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 a$flush_delayed = weak$$choice2 [L834] 4 a$mem_tmp = a [L835] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L835] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0) [L836] EXPR 4 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L836] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1) [L837] EXPR 4 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L837] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used) [L838] EXPR 4 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L838] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L839] EXPR 4 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4) [L840] EXPR 4 weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L840] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 4 !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0) [L841] EXPR 4 weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = a [L843] EXPR 4 a$flush_delayed ? a$mem_tmp : a [L843] 4 a = a$flush_delayed ? a$mem_tmp : a [L844] 4 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L768] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L771] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L772] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L788] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L788] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L789] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L789] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L790] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L790] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L791] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L791] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L792] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L792] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L847] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L847] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L848] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L848] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L849] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L849] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L850] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L850] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L851] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L851] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L882] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L882] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L883] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L883] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L884] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L884] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L885] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L885] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L886] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L886] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L889] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L18] COND TRUE 0 !expression [L17] COND FALSE 0 !(0) [L17] 0 __assert_fail ("0", "mix008_power.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 121 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 12.6s, HoareTripleCheckerStatistics: 546 SDtfs, 687 SDslu, 976 SDs, 0 SdLazy, 339 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5834occurred 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.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 198 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 306 NumberOfCodeBlocks, 306 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 47711 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...