./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 74b4b21266229b143e6109fc3e13bff6d4f49179 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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.1.25-9a8b2e8 [2020-10-20 03:02:02,883 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 03:02:02,885 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 03:02:02,909 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 03:02:02,910 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 03:02:02,911 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 03:02:02,913 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 03:02:02,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 03:02:02,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 03:02:02,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 03:02:02,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 03:02:02,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 03:02:02,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 03:02:02,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 03:02:02,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 03:02:02,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 03:02:02,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 03:02:02,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 03:02:02,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 03:02:02,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 03:02:02,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 03:02:02,933 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 03:02:02,934 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 03:02:02,935 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 03:02:02,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 03:02:02,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 03:02:02,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 03:02:02,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 03:02:02,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 03:02:02,940 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 03:02:02,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 03:02:02,941 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 03:02:02,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 03:02:02,943 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 03:02:02,944 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 03:02:02,944 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 03:02:02,945 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 03:02:02,945 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 03:02:02,945 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 03:02:02,946 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 03:02:02,947 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 03:02:02,948 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-20 03:02:02,987 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 03:02:02,987 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 03:02:02,990 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 03:02:02,990 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 03:02:02,991 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 03:02:02,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 03:02:02,991 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 03:02:02,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 03:02:02,992 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 03:02:02,992 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 03:02:02,993 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-20 03:02:02,994 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 03:02:02,994 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-20 03:02:02,994 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 03:02:02,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 03:02:02,995 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 03:02:02,995 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-20 03:02:02,995 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 03:02:02,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 03:02:02,996 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 03:02:02,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 03:02:02,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 03:02:02,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 03:02:02,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 03:02:02,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-20 03:02:02,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 03:02:02,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 03:02:02,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-20 03:02:02,999 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 03:02:02,999 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 74b4b21266229b143e6109fc3e13bff6d4f49179 [2020-10-20 03:02:03,231 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 03:02:03,243 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 03:02:03,246 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 03:02:03,248 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 03:02:03,248 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 03:02:03,249 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i [2020-10-20 03:02:03,307 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289b92a18/2e121914eec0445ca03b110988c284ec/FLAG2f59327c6 [2020-10-20 03:02:03,959 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 03:02:03,960 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/rfi009_power.oepc.i [2020-10-20 03:02:03,980 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289b92a18/2e121914eec0445ca03b110988c284ec/FLAG2f59327c6 [2020-10-20 03:02:04,228 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/289b92a18/2e121914eec0445ca03b110988c284ec [2020-10-20 03:02:04,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 03:02:04,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 03:02:04,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 03:02:04,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 03:02:04,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 03:02:04,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:02:04" (1/1) ... [2020-10-20 03:02:04,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eedc198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:04, skipping insertion in model container [2020-10-20 03:02:04,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 03:02:04" (1/1) ... [2020-10-20 03:02:04,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 03:02:04,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 03:02:04,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:02:04,896 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 03:02:04,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 03:02:05,070 INFO L208 MainTranslator]: Completed translation [2020-10-20 03:02:05,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05 WrapperNode [2020-10-20 03:02:05,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 03:02:05,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 03:02:05,072 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 03:02:05,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 03:02:05,084 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,184 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 03:02:05,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 03:02:05,185 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 03:02:05,189 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 03:02:05,200 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,200 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,221 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,226 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,231 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... [2020-10-20 03:02:05,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 03:02:05,239 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 03:02:05,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 03:02:05,240 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 03:02:05,241 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-10-20 03:02:05,313 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 03:02:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 03:02:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-20 03:02:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 03:02:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 03:02:05,314 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-20 03:02:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-20 03:02:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-20 03:02:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-20 03:02:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-20 03:02:05,315 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-20 03:02:05,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 03:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-20 03:02:05,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 03:02:05,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 03:02:05,326 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-20 03:02:09,367 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 03:02:09,367 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-20 03:02:09,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:02:09 BoogieIcfgContainer [2020-10-20 03:02:09,371 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 03:02:09,372 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 03:02:09,372 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 03:02:09,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 03:02:09,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 03:02:04" (1/3) ... [2020-10-20 03:02:09,378 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4b75cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:02:09, skipping insertion in model container [2020-10-20 03:02:09,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 03:02:05" (2/3) ... [2020-10-20 03:02:09,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4b75cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 03:02:09, skipping insertion in model container [2020-10-20 03:02:09,379 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:02:09" (3/3) ... [2020-10-20 03:02:09,381 INFO L111 eAbstractionObserver]: Analyzing ICFG rfi009_power.oepc.i [2020-10-20 03:02:09,396 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-20 03:02:09,397 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 03:02:09,408 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-20 03:02:09,409 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-20 03:02:09,459 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,460 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,467 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,468 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,469 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,470 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,471 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,472 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,473 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,474 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,475 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,476 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,477 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,478 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,479 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,480 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,481 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,482 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,483 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,484 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,485 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,486 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,492 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,492 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,493 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,493 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,494 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,495 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,496 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,497 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,498 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,499 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,506 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,509 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,510 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,510 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,511 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,511 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,512 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,513 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,519 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,520 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,521 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,521 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,522 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,523 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,523 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,524 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,525 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,526 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,527 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,528 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~mem7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,529 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,530 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,531 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,532 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,533 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite69| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,539 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite67| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite68| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,540 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite80| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,541 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem78| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,542 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem79| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,543 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite76| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,543 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite77| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite72| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite73| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,544 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite74| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,544 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite75| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite70| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite71| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,551 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,552 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite87| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite86| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite85| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite84| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite83| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite82| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem81| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 03:02:09,557 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-20 03:02:09,579 INFO L253 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2020-10-20 03:02:09,609 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 03:02:09,609 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-20 03:02:09,610 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 03:02:09,610 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 03:02:09,610 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 03:02:09,611 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 03:02:09,611 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 03:02:09,611 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 03:02:09,630 INFO L129 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2020-10-20 03:02:09,634 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 118 transitions, 251 flow [2020-10-20 03:02:09,639 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 118 transitions, 251 flow [2020-10-20 03:02:09,643 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 125 places, 118 transitions, 251 flow [2020-10-20 03:02:09,703 INFO L129 PetriNetUnfolder]: 3/115 cut-off events. [2020-10-20 03:02:09,704 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-20 03:02:09,709 INFO L80 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 3/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 68 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2020-10-20 03:02:09,713 INFO L117 LiptonReduction]: Number of co-enabled transitions 1570 [2020-10-20 03:02:09,849 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:09,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,070 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 4, 3, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:10,070 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,072 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:10,073 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,074 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:10,075 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,076 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:10,077 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,078 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 1] term [2020-10-20 03:02:10,079 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,080 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:10,080 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,081 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,082 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,091 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 4, 3, 5, 4, 5, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,092 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,094 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 4, 3, 5, 4, 5, 4, 5, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,095 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 5, 4, 4, 3, 5, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,097 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,098 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 4, 4, 3, 4, 3, 5, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,099 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,101 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 4, 3, 4, 3, 4, 3, 5, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,101 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,110 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,111 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,112 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:10,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:10,138 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 4, 4, 3, 4, 3, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,139 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,141 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 4, 4, 3, 5, 4, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,146 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 4, 5, 4, 5, 4, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,146 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,148 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 4, 5, 4, 4, 3, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,149 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,153 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 4, 4, 3, 4, 3, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,154 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,158 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 7, 3, 6, 3, 6, 2, 7, 4, 5, 4, 1] term [2020-10-20 03:02:10,159 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 4, 7, 4, 9, 4, 9, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,169 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 4, 7, 4, 9, 4, 9, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,170 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,173 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 4, 7, 4, 9, 4, 9, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,173 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,176 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 4, 7, 4, 9, 4, 9, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 3, 2, 1] term [2020-10-20 03:02:10,177 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,415 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 5, 4, 5, 4, 5, 4, 1] term [2020-10-20 03:02:10,416 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,417 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 2, 2, 4, 3, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,418 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,419 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,419 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,421 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 3, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,421 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,422 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,422 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,423 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,424 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,425 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 3, 2, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,425 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,455 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 4, 3, 5, 4, 5, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,456 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,457 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 3, 2, 4, 3, 5, 4, 5, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,459 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 3, 2, 5, 4, 5, 4, 5, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,460 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 5, 4, 5, 4, 5, 4, 5, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,464 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:10,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,470 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,472 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,473 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,474 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,475 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:10,476 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,479 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:10,488 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 4, 5, 4, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,489 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,491 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 4, 5, 4, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,492 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,496 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 3, 4, 4, 5, 4, 6, 4, 6, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,497 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:10,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[12, 2, 12, 2, 11, 3, 10, 4, 8, 4, 5, 4, 1] term [2020-10-20 03:02:10,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,504 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,504 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 4, 5, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 6, 4, 5, 4, 5, 4, 5, 4, 5, 4, 2, 1] term [2020-10-20 03:02:10,507 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,514 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:10,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,801 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:10,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:10,831 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:10,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,867 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:10,867 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,885 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,886 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,887 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,888 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,889 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:10,890 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:10,894 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:10,895 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:11,324 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:11,325 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:11,341 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:11,342 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:15,882 WARN L193 SmtUtils]: Spent 4.51 s on a formula simplification. DAG size of input: 406 DAG size of output: 364 [2020-10-20 03:02:15,915 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 5, 2, 4, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:15,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:15,917 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-20 03:02:15,917 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:15,918 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 3, 3, 2, 1] term [2020-10-20 03:02:15,918 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:15,919 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 3, 3, 2, 1] term [2020-10-20 03:02:15,919 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:15,920 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:15,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:15,954 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:15,954 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,086 WARN L193 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 198 DAG size of output: 172 [2020-10-20 03:02:18,096 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:18,096 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,127 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:18,127 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,210 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:18,211 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,261 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,263 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,264 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,265 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,266 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,269 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:18,269 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,272 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:18,283 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 3, 2, 4, 2, 5, 4, 6, 4, 6, 4, 5, 4, 1] term [2020-10-20 03:02:18,284 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:02:18,287 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 12, 2, 11, 2, 10, 4, 8, 4, 5, 4, 1] term [2020-10-20 03:02:18,288 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:18,355 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,356 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,358 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,358 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,359 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,359 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,360 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:18,361 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,363 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,363 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,364 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:18,364 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,366 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,369 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,370 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,371 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,372 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,373 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:18,374 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,375 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:18,381 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:18,382 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,386 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 5, 4, 5, 4, 5, 4, 1] term [2020-10-20 03:02:18,387 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,389 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 5, 4, 5, 4, 5, 4, 5, 4, 1] term [2020-10-20 03:02:18,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,393 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 5, 4, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:18,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,396 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 5, 4, 3, 2, 3, 2, 5, 4, 5, 4, 1] term [2020-10-20 03:02:18,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,400 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[10, 2, 7, 2, 6, 2, 6, 2, 7, 4, 5, 4, 1] term [2020-10-20 03:02:18,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:18,734 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:18,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,754 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:18,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:02:18,758 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:02:18,758 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:18,808 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,809 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,813 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,814 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,816 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:18,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,817 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:18,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,818 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:18,819 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:18,821 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:18,822 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,823 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:18,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,825 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:18,826 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:18,828 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:02:18,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:18,830 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:18,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:18,832 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:18,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:18,972 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,037 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:02:19,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,045 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:19,045 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:19,047 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:19,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:19,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,051 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:19,052 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,055 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:19,056 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:19,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:19,058 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:19,060 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:19,060 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:19,063 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:02:19,063 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:19,065 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:19,065 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:19,067 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:19,068 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:19,102 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:19,103 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,128 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:19,129 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-20 03:02:19,133 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:02:19,133 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:19,661 WARN L193 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 72 [2020-10-20 03:02:19,664 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:02:19,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,665 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:19,665 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:19,810 WARN L193 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2020-10-20 03:02:19,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:19,957 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,031 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 03:02:20,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,033 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,034 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,035 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,038 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 2, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,038 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-20 03:02:20,040 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 2, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,041 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-20 03:02:20,042 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,042 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-10-20 03:02:20,046 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[13, 2, 6, 3, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,046 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,048 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,048 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,050 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,050 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,052 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,053 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,054 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,054 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,057 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,057 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,059 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 8, 2, 8, 2, 9, 3, 4, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,059 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,116 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 2, 2, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,117 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:20,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,119 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:20,120 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 4, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:20,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 2, 5, 3, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,122 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 3, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,124 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,125 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 6, 2, 6, 3, 7, 3, 4, 3, 4, 3, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,126 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,394 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 03:02:20,394 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,396 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,397 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,398 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,400 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,403 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,404 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,406 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 5, 3, 4, 3, 5, 2, 5, 2, 1] term [2020-10-20 03:02:20,407 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:20,409 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:02:20,409 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,446 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,446 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,448 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,448 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:20,449 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,449 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:20,450 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,451 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:20,452 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:02:20,452 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,453 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,453 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,456 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,457 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,484 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,485 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,521 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:20,521 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,544 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 1] term [2020-10-20 03:02:20,545 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,632 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,688 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,688 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,690 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,690 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:20,691 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,692 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:20,692 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,693 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:20,694 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-20 03:02:20,694 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,696 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,696 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,697 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-20 03:02:20,697 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-10-20 03:02:20,733 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,736 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,738 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,739 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,741 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,742 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,743 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,745 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 3, 2, 5, 3, 5, 2, 5, 2, 1] term [2020-10-20 03:02:20,745 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 03:02:20,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[11, 2, 6, 3, 5, 3, 3, 2, 1] term [2020-10-20 03:02:20,748 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,903 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,904 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,905 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:20,905 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,906 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,907 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,908 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,908 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,909 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,910 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,911 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,912 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,913 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,914 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,915 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,916 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,937 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,937 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:02:20,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,969 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,970 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,970 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,971 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,972 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,977 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,978 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 5, 2, 4, 2, 1] term [2020-10-20 03:02:20,979 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:20,994 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,995 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 1] term [2020-10-20 03:02:20,995 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:20,997 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,997 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:20,998 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:20,999 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,000 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,031 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,208 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,209 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,211 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:21,212 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:21,213 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,213 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:21,214 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,215 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-20 03:02:21,216 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:21,217 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,217 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,218 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,220 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,220 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,221 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,222 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,223 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,223 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,224 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,225 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,226 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 2, 6, 2, 3, 2, 3, 2, 2, 1] term [2020-10-20 03:02:21,226 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 03:02:21,243 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:21,244 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:21,245 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:21,247 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:21,248 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:21,250 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 5, 2, 5, 2, 3, 2, 3, 2, 3, 2, 2, 2, 2, 1] term [2020-10-20 03:02:21,251 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 03:02:21,253 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-20 03:02:21,253 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 03:02:21,500 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2020-10-20 03:02:22,008 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 44 [2020-10-20 03:02:22,331 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2020-10-20 03:02:22,776 WARN L193 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-10-20 03:02:22,929 WARN L193 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 92 [2020-10-20 03:02:23,077 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-20 03:02:23,188 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-10-20 03:02:24,098 WARN L193 SmtUtils]: Spent 880.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 161 [2020-10-20 03:02:24,469 WARN L193 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 157 [2020-10-20 03:02:24,519 INFO L132 LiptonReduction]: Checked pairs total: 4604 [2020-10-20 03:02:24,520 INFO L134 LiptonReduction]: Total number of compositions: 116 [2020-10-20 03:02:24,529 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 33 places, 24 transitions, 63 flow [2020-10-20 03:02:24,581 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 450 states. [2020-10-20 03:02:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states. [2020-10-20 03:02:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 03:02:24,597 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:24,598 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:24,599 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:24,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1455459115, now seen corresponding path program 1 times [2020-10-20 03:02:24,617 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:24,618 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457349152] [2020-10-20 03:02:24,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:25,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:25,040 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457349152] [2020-10-20 03:02:25,044 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:25,044 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:02:25,045 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037017182] [2020-10-20 03:02:25,051 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:02:25,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:25,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:02:25,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:02:25,070 INFO L87 Difference]: Start difference. First operand 450 states. Second operand 3 states. [2020-10-20 03:02:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:25,147 INFO L93 Difference]: Finished difference Result 418 states and 1246 transitions. [2020-10-20 03:02:25,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:02:25,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-20 03:02:25,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:25,188 INFO L225 Difference]: With dead ends: 418 [2020-10-20 03:02:25,188 INFO L226 Difference]: Without dead ends: 338 [2020-10-20 03:02:25,190 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-10-20 03:02:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2020-10-20 03:02:25,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 338. [2020-10-20 03:02:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2020-10-20 03:02:25,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 982 transitions. [2020-10-20 03:02:25,270 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 982 transitions. Word has length 9 [2020-10-20 03:02:25,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:25,272 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 982 transitions. [2020-10-20 03:02:25,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:02:25,272 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 982 transitions. [2020-10-20 03:02:25,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 03:02:25,275 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:25,275 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:25,275 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 03:02:25,275 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2039333350, now seen corresponding path program 1 times [2020-10-20 03:02:25,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:25,277 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432227438] [2020-10-20 03:02:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:25,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:25,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:25,380 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432227438] [2020-10-20 03:02:25,380 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:25,380 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-20 03:02:25,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366698254] [2020-10-20 03:02:25,382 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-20 03:02:25,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:25,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-20 03:02:25,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-20 03:02:25,383 INFO L87 Difference]: Start difference. First operand 338 states and 982 transitions. Second operand 3 states. [2020-10-20 03:02:25,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:25,402 INFO L93 Difference]: Finished difference Result 326 states and 941 transitions. [2020-10-20 03:02:25,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-20 03:02:25,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-20 03:02:25,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:25,409 INFO L225 Difference]: With dead ends: 326 [2020-10-20 03:02:25,409 INFO L226 Difference]: Without dead ends: 326 [2020-10-20 03:02:25,410 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-10-20 03:02:25,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-10-20 03:02:25,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2020-10-20 03:02:25,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2020-10-20 03:02:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 941 transitions. [2020-10-20 03:02:25,452 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 941 transitions. Word has length 11 [2020-10-20 03:02:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:25,452 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 941 transitions. [2020-10-20 03:02:25,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-20 03:02:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 941 transitions. [2020-10-20 03:02:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-20 03:02:25,457 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:25,458 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:25,458 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 03:02:25,458 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:25,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:25,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1204188500, now seen corresponding path program 1 times [2020-10-20 03:02:25,459 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:25,460 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221807759] [2020-10-20 03:02:25,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:25,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:25,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:25,947 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221807759] [2020-10-20 03:02:25,947 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:25,948 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:02:25,948 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698935418] [2020-10-20 03:02:25,949 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 03:02:25,949 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 03:02:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:02:25,950 INFO L87 Difference]: Start difference. First operand 326 states and 941 transitions. Second operand 7 states. [2020-10-20 03:02:26,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:26,162 INFO L93 Difference]: Finished difference Result 317 states and 911 transitions. [2020-10-20 03:02:26,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:02:26,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2020-10-20 03:02:26,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:26,167 INFO L225 Difference]: With dead ends: 317 [2020-10-20 03:02:26,167 INFO L226 Difference]: Without dead ends: 317 [2020-10-20 03:02:26,170 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:02:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2020-10-20 03:02:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2020-10-20 03:02:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2020-10-20 03:02:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 911 transitions. [2020-10-20 03:02:26,184 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 911 transitions. Word has length 12 [2020-10-20 03:02:26,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:26,185 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 911 transitions. [2020-10-20 03:02:26,185 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 03:02:26,185 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 911 transitions. [2020-10-20 03:02:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-20 03:02:26,187 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:26,187 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:26,187 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 03:02:26,188 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1348937279, now seen corresponding path program 1 times [2020-10-20 03:02:26,188 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:26,189 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848856688] [2020-10-20 03:02:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:26,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:26,295 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848856688] [2020-10-20 03:02:26,295 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:26,296 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:02:26,296 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089664932] [2020-10-20 03:02:26,296 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:02:26,296 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:26,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:02:26,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:02:26,300 INFO L87 Difference]: Start difference. First operand 317 states and 911 transitions. Second operand 4 states. [2020-10-20 03:02:26,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:26,349 INFO L93 Difference]: Finished difference Result 317 states and 811 transitions. [2020-10-20 03:02:26,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 03:02:26,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-20 03:02:26,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:26,353 INFO L225 Difference]: With dead ends: 317 [2020-10-20 03:02:26,353 INFO L226 Difference]: Without dead ends: 237 [2020-10-20 03:02:26,353 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-10-20 03:02:26,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2020-10-20 03:02:26,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2020-10-20 03:02:26,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2020-10-20 03:02:26,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 591 transitions. [2020-10-20 03:02:26,363 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 591 transitions. Word has length 13 [2020-10-20 03:02:26,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:26,363 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 591 transitions. [2020-10-20 03:02:26,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:02:26,363 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 591 transitions. [2020-10-20 03:02:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:02:26,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:26,365 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:26,365 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 03:02:26,365 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:26,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:26,366 INFO L82 PathProgramCache]: Analyzing trace with hash -777216148, now seen corresponding path program 1 times [2020-10-20 03:02:26,366 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:26,366 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13334017] [2020-10-20 03:02:26,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:26,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:26,523 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13334017] [2020-10-20 03:02:26,524 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:26,524 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:02:26,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9706456] [2020-10-20 03:02:26,524 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:02:26,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:26,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:02:26,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:02:26,525 INFO L87 Difference]: Start difference. First operand 237 states and 591 transitions. Second operand 5 states. [2020-10-20 03:02:26,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:26,664 INFO L93 Difference]: Finished difference Result 318 states and 768 transitions. [2020-10-20 03:02:26,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:02:26,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-20 03:02:26,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:26,668 INFO L225 Difference]: With dead ends: 318 [2020-10-20 03:02:26,668 INFO L226 Difference]: Without dead ends: 256 [2020-10-20 03:02:26,668 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-20 03:02:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2020-10-20 03:02:26,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 240. [2020-10-20 03:02:26,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-10-20 03:02:26,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 592 transitions. [2020-10-20 03:02:26,678 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 592 transitions. Word has length 15 [2020-10-20 03:02:26,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:26,678 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 592 transitions. [2020-10-20 03:02:26,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:02:26,678 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 592 transitions. [2020-10-20 03:02:26,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:02:26,680 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:26,680 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:26,680 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 03:02:26,680 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:26,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:26,680 INFO L82 PathProgramCache]: Analyzing trace with hash 664787416, now seen corresponding path program 1 times [2020-10-20 03:02:26,681 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:26,681 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408569495] [2020-10-20 03:02:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:26,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:26,740 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408569495] [2020-10-20 03:02:26,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:26,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-20 03:02:26,741 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659372300] [2020-10-20 03:02:26,741 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-20 03:02:26,742 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:26,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 03:02:26,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 03:02:26,742 INFO L87 Difference]: Start difference. First operand 240 states and 592 transitions. Second operand 4 states. [2020-10-20 03:02:26,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:26,768 INFO L93 Difference]: Finished difference Result 346 states and 825 transitions. [2020-10-20 03:02:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-20 03:02:26,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-20 03:02:26,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:26,771 INFO L225 Difference]: With dead ends: 346 [2020-10-20 03:02:26,771 INFO L226 Difference]: Without dead ends: 250 [2020-10-20 03:02:26,771 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-10-20 03:02:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2020-10-20 03:02:26,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 240. [2020-10-20 03:02:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2020-10-20 03:02:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 554 transitions. [2020-10-20 03:02:26,778 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 554 transitions. Word has length 15 [2020-10-20 03:02:26,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:26,778 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 554 transitions. [2020-10-20 03:02:26,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-20 03:02:26,779 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 554 transitions. [2020-10-20 03:02:26,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-20 03:02:26,779 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:26,780 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:26,780 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 03:02:26,780 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:26,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:26,780 INFO L82 PathProgramCache]: Analyzing trace with hash 677508173, now seen corresponding path program 1 times [2020-10-20 03:02:26,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:26,781 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306845010] [2020-10-20 03:02:26,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:26,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:26,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:26,892 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306845010] [2020-10-20 03:02:26,892 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:26,892 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 03:02:26,892 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544450084] [2020-10-20 03:02:26,892 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 03:02:26,893 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:26,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 03:02:26,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 03:02:26,893 INFO L87 Difference]: Start difference. First operand 240 states and 554 transitions. Second operand 5 states. [2020-10-20 03:02:26,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:26,943 INFO L93 Difference]: Finished difference Result 203 states and 428 transitions. [2020-10-20 03:02:26,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 03:02:26,944 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2020-10-20 03:02:26,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:26,946 INFO L225 Difference]: With dead ends: 203 [2020-10-20 03:02:26,946 INFO L226 Difference]: Without dead ends: 159 [2020-10-20 03:02:26,946 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-10-20 03:02:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2020-10-20 03:02:26,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2020-10-20 03:02:26,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-10-20 03:02:26,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 327 transitions. [2020-10-20 03:02:26,951 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 327 transitions. Word has length 15 [2020-10-20 03:02:26,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:26,952 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 327 transitions. [2020-10-20 03:02:26,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 03:02:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 327 transitions. [2020-10-20 03:02:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:02:26,953 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:26,953 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:26,953 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 03:02:26,953 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:26,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1829552830, now seen corresponding path program 1 times [2020-10-20 03:02:26,954 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:26,955 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714794499] [2020-10-20 03:02:26,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:26,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:27,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:27,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714794499] [2020-10-20 03:02:27,408 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:27,408 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 03:02:27,408 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987473873] [2020-10-20 03:02:27,409 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 03:02:27,409 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:27,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 03:02:27,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-10-20 03:02:27,409 INFO L87 Difference]: Start difference. First operand 159 states and 327 transitions. Second operand 8 states. [2020-10-20 03:02:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:27,783 INFO L93 Difference]: Finished difference Result 252 states and 481 transitions. [2020-10-20 03:02:27,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:02:27,787 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2020-10-20 03:02:27,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:27,788 INFO L225 Difference]: With dead ends: 252 [2020-10-20 03:02:27,789 INFO L226 Difference]: Without dead ends: 184 [2020-10-20 03:02:27,789 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2020-10-20 03:02:27,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2020-10-20 03:02:27,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 147. [2020-10-20 03:02:27,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2020-10-20 03:02:27,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 287 transitions. [2020-10-20 03:02:27,793 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 287 transitions. Word has length 17 [2020-10-20 03:02:27,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:27,794 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 287 transitions. [2020-10-20 03:02:27,794 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 03:02:27,794 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 287 transitions. [2020-10-20 03:02:27,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-10-20 03:02:27,795 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:27,795 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 03:02:27,795 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 03:02:27,795 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:27,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:27,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1781392510, now seen corresponding path program 2 times [2020-10-20 03:02:27,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:27,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492823751] [2020-10-20 03:02:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 03:02:27,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 03:02:27,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492823751] [2020-10-20 03:02:27,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 03:02:27,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 03:02:27,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566795508] [2020-10-20 03:02:27,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 03:02:27,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 03:02:27,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 03:02:27,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 03:02:27,932 INFO L87 Difference]: Start difference. First operand 147 states and 287 transitions. Second operand 6 states. [2020-10-20 03:02:28,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 03:02:28,006 INFO L93 Difference]: Finished difference Result 132 states and 257 transitions. [2020-10-20 03:02:28,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 03:02:28,007 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-10-20 03:02:28,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 03:02:28,008 INFO L225 Difference]: With dead ends: 132 [2020-10-20 03:02:28,008 INFO L226 Difference]: Without dead ends: 61 [2020-10-20 03:02:28,008 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-10-20 03:02:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2020-10-20 03:02:28,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2020-10-20 03:02:28,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2020-10-20 03:02:28,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 112 transitions. [2020-10-20 03:02:28,013 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 112 transitions. Word has length 17 [2020-10-20 03:02:28,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 03:02:28,013 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 112 transitions. [2020-10-20 03:02:28,013 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 03:02:28,013 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 112 transitions. [2020-10-20 03:02:28,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-20 03:02:28,014 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 03:02:28,014 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-10-20 03:02:28,014 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 03:02:28,014 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-20 03:02:28,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 03:02:28,014 INFO L82 PathProgramCache]: Analyzing trace with hash -180771887, now seen corresponding path program 1 times [2020-10-20 03:02:28,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 03:02:28,015 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023731227] [2020-10-20 03:02:28,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 03:02:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:02:28,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:02:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 03:02:28,206 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 03:02:28,249 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 03:02:28,249 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 03:02:28,250 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 03:02:28,251 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-20 03:02:28,276 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1538] [1538] L3-->L866: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In470137650 256) 0)) (.cse7 (= (mod ~x$w_buff1_used~0_In470137650 256) 0)) (.cse10 (= (mod ~x$r_buff0_thd0~0_In470137650 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In470137650 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse10)) (.cse5 (or .cse9 .cse10)) (.cse0 (or .cse8 .cse7)) (.cse1 (not .cse8)) (.cse2 (not .cse7))) (and (or (and (= ~x$w_buff1_used~0_In470137650 ~x$w_buff1_used~0_Out470137650) .cse0) (and (= ~x$w_buff1_used~0_Out470137650 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out470137650 0)) (or (and .cse3 (= ~x$w_buff0_used~0_Out470137650 0) .cse4) (and .cse5 (= ~x$w_buff0_used~0_In470137650 ~x$w_buff0_used~0_Out470137650))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In470137650| ULTIMATE.start_assume_abort_if_not_~cond_Out470137650) (let ((.cse6 (select |#memory_int_In470137650| |~#x~0.base_In470137650|))) (or (and .cse3 .cse4 (= (store |#memory_int_In470137650| |~#x~0.base_In470137650| (store .cse6 |~#x~0.offset_In470137650| ~x$w_buff0~0_In470137650)) |#memory_int_Out470137650|)) (and .cse5 (or (and (= |#memory_int_Out470137650| (store |#memory_int_In470137650| |~#x~0.base_In470137650| (store .cse6 |~#x~0.offset_In470137650| (select .cse6 |~#x~0.offset_In470137650|)))) .cse0) (and (= (store |#memory_int_In470137650| |~#x~0.base_In470137650| (store .cse6 |~#x~0.offset_In470137650| ~x$w_buff1~0_In470137650)) |#memory_int_Out470137650|) .cse1 .cse2))))) (= ~x$r_buff1_thd0~0_Out470137650 ~x$r_buff1_thd0~0_In470137650) (= ~x$r_buff0_thd0~0_In470137650 ~x$r_buff0_thd0~0_Out470137650)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In470137650, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In470137650, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In470137650|, ~#x~0.offset=|~#x~0.offset_In470137650|, ~x$w_buff1~0=~x$w_buff1~0_In470137650, #memory_int=|#memory_int_In470137650|, ~#x~0.base=|~#x~0.base_In470137650|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In470137650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In470137650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In470137650} OutVars{~x$w_buff0~0=~x$w_buff0~0_In470137650, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out470137650, ~#x~0.offset=|~#x~0.offset_In470137650|, ~x$w_buff1~0=~x$w_buff1~0_In470137650, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out470137650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out470137650, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out470137650|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out470137650, ULTIMATE.start_main_#t~ite96=|ULTIMATE.start_main_#t~ite96_Out470137650|, ULTIMATE.start_main_#t~ite95=|ULTIMATE.start_main_#t~ite95_Out470137650|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In470137650|, ULTIMATE.start_main_#t~ite94=|ULTIMATE.start_main_#t~ite94_Out470137650|, ULTIMATE.start_main_#t~ite93=|ULTIMATE.start_main_#t~ite93_Out470137650|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out470137650, ULTIMATE.start_main_#t~ite92=|ULTIMATE.start_main_#t~ite92_Out470137650|, ULTIMATE.start_main_#t~mem91=|ULTIMATE.start_main_#t~mem91_Out470137650|, #memory_int=|#memory_int_Out470137650|, ~#x~0.base=|~#x~0.base_In470137650|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite97, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ULTIMATE.start_main_#t~ite94, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~mem91, #memory_int] because there is no mapped edge [2020-10-20 03:02:28,285 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,286 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,286 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,287 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,287 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,288 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,288 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,288 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,289 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,289 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,289 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,290 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,290 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,291 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,291 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,292 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,293 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,293 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,294 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,294 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,295 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,295 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,296 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,296 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,296 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,296 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,296 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,297 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,297 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,297 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,298 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,298 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,299 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,299 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,299 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,300 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,300 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,300 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,300 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,300 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,301 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,301 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,301 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,302 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,302 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,303 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,379 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 03:02:28 BasicIcfg [2020-10-20 03:02:28,380 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 03:02:28,380 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 03:02:28,380 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 03:02:28,380 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 03:02:28,381 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 03:02:09" (3/4) ... [2020-10-20 03:02:28,384 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-20 03:02:28,402 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1538] [1538] L3-->L866: Formula: (let ((.cse8 (= (mod ~x$r_buff1_thd0~0_In470137650 256) 0)) (.cse7 (= (mod ~x$w_buff1_used~0_In470137650 256) 0)) (.cse10 (= (mod ~x$r_buff0_thd0~0_In470137650 256) 0)) (.cse9 (= (mod ~x$w_buff0_used~0_In470137650 256) 0))) (let ((.cse3 (not .cse9)) (.cse4 (not .cse10)) (.cse5 (or .cse9 .cse10)) (.cse0 (or .cse8 .cse7)) (.cse1 (not .cse8)) (.cse2 (not .cse7))) (and (or (and (= ~x$w_buff1_used~0_In470137650 ~x$w_buff1_used~0_Out470137650) .cse0) (and (= ~x$w_buff1_used~0_Out470137650 0) .cse1 .cse2)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out470137650 0)) (or (and .cse3 (= ~x$w_buff0_used~0_Out470137650 0) .cse4) (and .cse5 (= ~x$w_buff0_used~0_In470137650 ~x$w_buff0_used~0_Out470137650))) (= |ULTIMATE.start_assume_abort_if_not_#in~cond_In470137650| ULTIMATE.start_assume_abort_if_not_~cond_Out470137650) (let ((.cse6 (select |#memory_int_In470137650| |~#x~0.base_In470137650|))) (or (and .cse3 .cse4 (= (store |#memory_int_In470137650| |~#x~0.base_In470137650| (store .cse6 |~#x~0.offset_In470137650| ~x$w_buff0~0_In470137650)) |#memory_int_Out470137650|)) (and .cse5 (or (and (= |#memory_int_Out470137650| (store |#memory_int_In470137650| |~#x~0.base_In470137650| (store .cse6 |~#x~0.offset_In470137650| (select .cse6 |~#x~0.offset_In470137650|)))) .cse0) (and (= (store |#memory_int_In470137650| |~#x~0.base_In470137650| (store .cse6 |~#x~0.offset_In470137650| ~x$w_buff1~0_In470137650)) |#memory_int_Out470137650|) .cse1 .cse2))))) (= ~x$r_buff1_thd0~0_Out470137650 ~x$r_buff1_thd0~0_In470137650) (= ~x$r_buff0_thd0~0_In470137650 ~x$r_buff0_thd0~0_Out470137650)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In470137650, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In470137650, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In470137650|, ~#x~0.offset=|~#x~0.offset_In470137650|, ~x$w_buff1~0=~x$w_buff1~0_In470137650, #memory_int=|#memory_int_In470137650|, ~#x~0.base=|~#x~0.base_In470137650|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In470137650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In470137650, ~x$w_buff0_used~0=~x$w_buff0_used~0_In470137650} OutVars{~x$w_buff0~0=~x$w_buff0~0_In470137650, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out470137650, ~#x~0.offset=|~#x~0.offset_In470137650|, ~x$w_buff1~0=~x$w_buff1~0_In470137650, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out470137650, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out470137650, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out470137650|, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out470137650, ULTIMATE.start_main_#t~ite96=|ULTIMATE.start_main_#t~ite96_Out470137650|, ULTIMATE.start_main_#t~ite95=|ULTIMATE.start_main_#t~ite95_Out470137650|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In470137650|, ULTIMATE.start_main_#t~ite94=|ULTIMATE.start_main_#t~ite94_Out470137650|, ULTIMATE.start_main_#t~ite93=|ULTIMATE.start_main_#t~ite93_Out470137650|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out470137650, ULTIMATE.start_main_#t~ite92=|ULTIMATE.start_main_#t~ite92_Out470137650|, ULTIMATE.start_main_#t~mem91=|ULTIMATE.start_main_#t~mem91_Out470137650|, #memory_int=|#memory_int_Out470137650|, ~#x~0.base=|~#x~0.base_In470137650|} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ~x$w_buff1_used~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite97, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite96, ULTIMATE.start_main_#t~ite95, ULTIMATE.start_main_#t~ite94, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite92, ULTIMATE.start_main_#t~mem91, #memory_int] because there is no mapped edge [2020-10-20 03:02:28,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,425 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,426 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,426 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,427 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,427 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,427 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-20 03:02:28,427 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-20 03:02:28,578 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-20 03:02:28,578 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 03:02:28,580 INFO L168 Benchmark]: Toolchain (without parser) took 24347.11 ms. Allocated memory was 45.1 MB in the beginning and 170.9 MB in the end (delta: 125.8 MB). Free memory was 24.0 MB in the beginning and 118.1 MB in the end (delta: -94.0 MB). Peak memory consumption was 143.2 MB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,580 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 33.0 MB. Free memory was 12.3 MB in the beginning and 12.2 MB in the end (delta: 50.4 kB). Peak memory consumption was 50.4 kB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,581 INFO L168 Benchmark]: CACSL2BoogieTranslator took 831.06 ms. Allocated memory was 45.1 MB in the beginning and 48.2 MB in the end (delta: 3.1 MB). Free memory was 23.2 MB in the beginning and 18.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.32 ms. Allocated memory is still 48.2 MB. Free memory was 18.8 MB in the beginning and 16.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,581 INFO L168 Benchmark]: Boogie Preprocessor took 54.13 ms. Allocated memory is still 48.2 MB. Free memory was 16.1 MB in the beginning and 12.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,582 INFO L168 Benchmark]: RCFGBuilder took 4131.84 ms. Allocated memory was 48.2 MB in the beginning and 99.1 MB in the end (delta: 50.9 MB). Free memory was 12.9 MB in the beginning and 62.1 MB in the end (delta: -49.3 MB). Peak memory consumption was 44.6 MB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,582 INFO L168 Benchmark]: TraceAbstraction took 19007.50 ms. Allocated memory was 99.1 MB in the beginning and 170.4 MB in the end (delta: 71.3 MB). Free memory was 60.9 MB in the beginning and 25.2 MB in the end (delta: 35.7 MB). Peak memory consumption was 107.0 MB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,583 INFO L168 Benchmark]: Witness Printer took 198.48 ms. Allocated memory was 170.4 MB in the beginning and 170.9 MB in the end (delta: 524.3 kB). Free memory was 25.2 MB in the beginning and 118.1 MB in the end (delta: -92.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 14.3 GB. [2020-10-20 03:02:28,586 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 33.0 MB. Free memory was 12.3 MB in the beginning and 12.2 MB in the end (delta: 50.4 kB). Peak memory consumption was 50.4 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 831.06 ms. Allocated memory was 45.1 MB in the beginning and 48.2 MB in the end (delta: 3.1 MB). Free memory was 23.2 MB in the beginning and 18.8 MB in the end (delta: 4.4 MB). Peak memory consumption was 14.3 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 112.32 ms. Allocated memory is still 48.2 MB. Free memory was 18.8 MB in the beginning and 16.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 54.13 ms. Allocated memory is still 48.2 MB. Free memory was 16.1 MB in the beginning and 12.9 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 14.3 GB. * RCFGBuilder took 4131.84 ms. Allocated memory was 48.2 MB in the beginning and 99.1 MB in the end (delta: 50.9 MB). Free memory was 12.9 MB in the beginning and 62.1 MB in the end (delta: -49.3 MB). Peak memory consumption was 44.6 MB. Max. memory is 14.3 GB. * TraceAbstraction took 19007.50 ms. Allocated memory was 99.1 MB in the beginning and 170.4 MB in the end (delta: 71.3 MB). Free memory was 60.9 MB in the beginning and 25.2 MB in the end (delta: 35.7 MB). Peak memory consumption was 107.0 MB. Max. memory is 14.3 GB. * Witness Printer took 198.48 ms. Allocated memory was 170.4 MB in the beginning and 170.9 MB in the end (delta: 524.3 kB). Free memory was 25.2 MB in the beginning and 118.1 MB in the end (delta: -92.8 MB). Peak memory consumption was 19.1 MB. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 1138 VarBasedMoverChecksPositive, 70 VarBasedMoverChecksNegative, 20 SemBasedMoverChecksPositive, 50 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.9s, 106 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 14.8s, 125 PlacesBefore, 33 PlacesAfterwards, 118 TransitionsBefore, 24 TransitionsAfterwards, 1570 CoEnabledTransitionPairs, 8 FixpointIterations, 55 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 4604 MoverChecksTotal - CounterExampleResult [Line: 18]: 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_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p0_EBX = 0; [L732] 0 int __unbuffered_p1_EAX = 0; [L734] 0 int __unbuffered_p1_EBX = 0; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L739] 0 _Bool x$flush_delayed; [L740] 0 int x$mem_tmp; [L741] 0 _Bool x$r_buff0_thd0; [L742] 0 _Bool x$r_buff0_thd1; [L743] 0 _Bool x$r_buff0_thd2; [L744] 0 _Bool x$r_buff0_thd3; [L745] 0 _Bool x$r_buff1_thd0; [L746] 0 _Bool x$r_buff1_thd1; [L747] 0 _Bool x$r_buff1_thd2; [L748] 0 _Bool x$r_buff1_thd3; [L749] 0 _Bool x$read_delayed; [L750] 0 int *x$read_delayed_var; [L751] 0 int x$w_buff0; [L752] 0 _Bool x$w_buff0_used; [L753] 0 int x$w_buff1; [L754] 0 _Bool x$w_buff1_used; [L756] 0 int y = 0; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L850] 0 pthread_t t1737; [L851] FCALL, FORK 0 pthread_create(&t1737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L852] 0 pthread_t t1738; [L853] FCALL, FORK 0 pthread_create(&t1738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L854] 0 pthread_t t1739; [L855] FCALL, FORK 0 pthread_create(&t1739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 x$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(x) [L766] 1 x$mem_tmp = x [L767] 1 weak$$choice1 = __VERIFIER_nondet_bool() [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L768] 1 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L769] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)))) [L770] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)))) [L771] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : weak$$choice0)))) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] EXPR 1 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L772] EXPR 1 x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] EXPR 1 !x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L772] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] EXPR 1 !x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))) [L773] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (weak$$choice0 ? x$r_buff1_thd1 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd1 && x$w_buff1_used && !x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)))) [L775] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L776] 1 __unbuffered_p0_EAX$read_delayed_var = &x [L777] EXPR 1 \read(x) [L777] 1 __unbuffered_p0_EAX = x [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] EXPR 1 \read(x) [L778] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L778] 1 x = x$flush_delayed ? x$mem_tmp : x [L779] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L782] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=255, weak$$choice2=1, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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$$choice1=255, weak$$choice2=1, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L797] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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$$choice1=255, weak$$choice2=1, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L801] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L802] 2 x$flush_delayed = weak$$choice2 [L803] EXPR 2 \read(x) [L803] 2 x$mem_tmp = x [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] EXPR 2 \read(x) [L804] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L804] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L805] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L805] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L806] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L806] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L807] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L807] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L807] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used) [L807] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L807] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L808] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0) [L808] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L808] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L809] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L809] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L810] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L810] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 2 \read(x) [L811] 2 __unbuffered_p1_EBX = x [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] EXPR 2 \read(x) [L812] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L812] 2 x = x$flush_delayed ? x$mem_tmp : x [L813] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice1=255, weak$$choice2=0, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L825] 3 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice1=255, weak$$choice2=0, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L787] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 1 return 0; [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 \read(x) [L828] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L828] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L828] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L829] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L830] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L830] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L832] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L832] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L835] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L837] 3 return 0; [L857] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L868] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L869] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L869] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L870] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) [L19] COND TRUE 0 !expression [L18] COND FALSE 0 !(0) [L18] 0 __assert_fail ("0", "rfi009_power.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={8:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=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=3, weak$$choice1=255, weak$$choice2=0, x={8:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 116 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 18.6s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.9s, HoareTripleCheckerStatistics: 210 SDtfs, 195 SDslu, 344 SDs, 0 SdLazy, 234 SolverSat, 58 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=450occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 63 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 143 NumberOfCodeBlocks, 143 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 15883 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...